Galina Jirásková

ORCID

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 41

Top Venues

Publications

Michal Hospodár, Galina Jirásková
Operational Complexity in Subregular Classes. CIAA (2023)
Galina Jirásková, Giovanni Pighizzini
Preface. J. Autom. Lang. Comb. 28 (1-3) (2023)
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
Operational Complexity: NFA-to-DFA Trade-Off. DCFS (2023)
Galina Jirásková
Operations on Boolean and Alternating Finite Automata. AFL (2023)
Galina Jirásková, Stavros Konstantinidis
Descriptional Complexity of Formal Systems (DCFS 2019). Inf. Comput. 284 (2022)
Galina Jirásková, Ondrej Klíma
On linear languages recognized by deterministic biautomata. Inf. Comput. 286 (2022)
Galina Jirásková, Cezar Câmpeanu
Special Issue on Implementation and Application of Automata. Theor. Comput. Sci. 870 (2021)
Jozef Jirásek, Galina Jirásková
Multiple Concatenation and State Complexity (Extended Abstract). DCFS (2020)
Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
Preface. J. Autom. Lang. Comb. 25 (2-3) (2020)
Galina Jirásková, Ondrej Klíma
Deterministic Biautomata and Subclasses of Deterministic Linear Languages. LATA (2019)
Galina Jirásková, Ivana Krajnáková
NFA-to-DFA Trade-Off for Regular Operations. DCFS (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787 (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Descriptional Complexity of the Forever Operator. Int. J. Found. Comput. Sci. 30 (1) (2019)
Galina Jirásková
Report on CIAA 2018. Bull. EATCS 127 (2019)
Galina Jirásková, Alexander Okhotin
State complexity of unambiguous operations on finite automata. Theor. Comput. Sci. 798 (2019)
Galina Jirásková, Ivana Krajnáková
Square on Deterministic, Alternating, and Boolean Finite Automata. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Galina Jirásková, Alexander Okhotin
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. DLT (2018)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29 (5) (2018)
Jozef Jirásek, Galina Jirásková
The Exact Complexity of Star-Complement-Star. CIAA (2018)
Galina Jirásková, Alexander Okhotin
State Complexity of Unambiguous Operations on Deterministic Finite Automata. DCFS (2018)
Michal Hospodár, Galina Jirásková, Ivana Krajnáková
Operations on Boolean and Alternating Finite Automata. CSR (2018)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Adventures Between Lower Bounds and Higher Altitudes (2018)
Michal Hospodár, Galina Jirásková
The complexity of concatenation on deterministic and alternating finite automata. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Ivana Krajnáková, Galina Jirásková
Square on Deterministic, Alternating, and Boolean Finite Automata. DCFS (2017)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. DLT (2017)
Galina Jirásková, Alexander Okhotin
On the state complexity of operations on two-way finite automata. Inf. Comput. 253 (2017)
Galina Jirásková, Matús Palmovský
Star-complement-star and Kuratowski algebras on prefix-free languages. NCMA (2017)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA (2017)
Galina Jirásková, Alexander Szabari, Juraj Sebej
The Complexity of Languages Resulting from the Concatenation Operation. J. Autom. Lang. Comb. 22 (1-3) (2017)
Galina Jirásková
Self-Verifying Finite Automata and Descriptional Complexity. DCFS (2016)
Michal Hospodár, Galina Jirásková
Concatenation on deterministic and alternating automata. NCMA (2016)
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
On the State Complexity of the Shuffle of Regular Languages. DCFS (2016)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Closed and Ideal Languages. CIAA (2016)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
Operations on Unambiguous Finite Automata. DLT (2016)
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
State Complexity of Basic Operations on Non-Returning Regular Languages. Fundam. Informaticae 144 (2) (2016)
Galina Jirásková, Alexander Szabari, Juraj Sebej
The Complexity of Languages Resulting from the Concatenation Operation. DCFS (2016)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610 (2016)
Jozef Jirásek, Galina Jirásková
The Boundary of Prefix-Free Languages. DLT (2015)
Jozef Jirásek, Galina Jirásková
On the boundary of regular languages. Theor. Comput. Sci. 578 (2015)
Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari
Operations on Self-Verifying Finite Automata. CSR (2015)
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
On the State Complexity of the Shuffle of Regular Languages. CoRR (2015)
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
Quotient Complexity of Closed Languages. Theory Comput. Syst. 54 (2) (2014)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
Prefix-Free Languages: Right Quotient and Reversal. DCFS (2014)
Stepan Holub, Galina Jirásková, Tomás Masopust
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) (2014)
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages. Acta Cybern. 21 (4) (2014)
Galina Jirásková, Tomás Masopust
On Upper and Lower Bounds on the Length of Alternating Towers. CoRR (2014)
Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej
Operations on Automata with All States Final. AFL (2014)
Galina Jirásková
The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages. Int. J. Found. Comput. Sci. 25 (1) (2014)
Galina Jirásková, Matús Palmovský, Juraj Sebej
Kleene Closure on Regular and Prefix-Free Languages. CIAA (2014)
Kristína Cevorová, Galina Jirásková, Ivana Krajnáková
On the Square of Regular Languages. CIAA (2014)
Galina Jirásková, Peter Mlynárcik
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. DCFS (2014)
Galina Jirásková, Matús Palmovský
Kleene Closure and State Complexity. ITAT (2013)
Jozef Jirásek, Galina Jirásková
On the Boundary of Regular Languages. CIAA (2013)
Galina Jirásková, Tomás Masopust
On the State Complexity of the Reverse of R- and J-trivial Regular Languages CoRR (2013)
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
State Complexity of Basic Operations on Non-returning Regular Languages. DCFS (2013)
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
Quotient complexity of ideal languages. Theor. Comput. Sci. 470 (2013)
Galina Jirásková, Tomás Masopust
On the State Complexity of the Reverse of - and -Trivial Regular Languages. DCFS (2013)
Jozef Jirásek, Galina Jirásková
Cyclic Shift on Prefix-Free Languages. CSR (2013)
Galina Jirásková, Juraj Sebej
Reversal of binary regular languages. Theor. Comput. Sci. 449 (2012)
Galina Jirásková, Ondrej Klíma
Descriptional Complexity of Biautomata. DCFS (2012)
Galina Jirásková, Tomás Masopust
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA (2012)
Galina Jirásková, Benedek Nagy
On Union-Free and Deterministic Union-Free Languages. IFIP TCS (2012)
Galina Jirásková
Descriptional Complexity of Operations on Alternating and Boolean Automata. CSR (2012)
Galina Jirásková, Jeffrey O. Shallit
The state complexity of star-complement-star CoRR (2012)
Galina Jirásková, Jeffrey O. Shallit
The State Complexity of Star-Complement-Star. Developments in Language Theory (2012)
Galina Jirásková, Tomás Masopust
On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS (2012)
Galina Jirásková, Tomás Masopust
On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449 (2012)
Galina Jirásková, Juraj Sebej
Note on Reversal of Binary Regular Languages. DCFS (2011)
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages. AFL (2011)
Galina Jirásková
Concatenation of Regular Languages and Descriptional Complexity. Theory Comput. Syst. 49 (2) (2011)
Galina Jirásková, Alexander Okhotin
On the State Complexity of Star of Union and Star of Intersection. Fundam. Informaticae 109 (2) (2011)
Roland Cmorik, Galina Jirásková
Basic Operations on Binary Suffix-Free Languages. MEMICS (2011)
Galina Jirásková
Magic Numbers and Ternary Alphabet. Int. J. Found. Comput. Sci. 22 (2) (2011)
Galina Jirásková, Tomás Masopust
Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22 (7) (2011)
Galina Jirásková, Giovanni Pighizzini
Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209 (3) (2011)
Galina Jirásková, Tomás Masopust
State Complexity of Projected Languages. DCFS (2011)
Galina Jirásková, Monika Krausová
Complexity in Prefix-Free Regular Languages DCFS (2010)
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
Quotient Complexity of Closed Languages. CSR (2010)
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
Quotient Complexity of Ideal Languages. LATIN (2010)
Galina Jirásková, Tomás Masopust
Complexity in Union-Free Regular Languages. Developments in Language Theory (2010)
Janusz A. Brzozowski, Galina Jirásková, Joshua Smith
Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages CoRR (2010)
Galina Jirásková, Alexander Okhotin
Nondeterministic State Complexity of Positional Addition. J. Autom. Lang. Comb. 15 (1/2) (2010)
Galina Jirásková, Alexander Okhotin
Nondeterministic State Complexity of Positional Addition DCFS (2009)
Galina Jirásková, Pavol Olejár
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. NCMA (2009)
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
Quotient complexity of ideal languages CoRR (2009)
Galina Jirásková, Giovanni Pighizzini
Converting Self-verifying Automata into Deterministic Automata. LATA (2009)
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
Quotient Complexity of Closed Languages CoRR (2009)
Galina Jirásková
Concatenation of Regular Languages and Descriptional Complexity. CSR (2009)
Galina Jirásková
Magic Numbers and Ternary Alphabet. Developments in Language Theory (2009)
Galina Jirásková, Alexander Okhotin
State complexity of cyclic shift. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Galina Jirásková
On the State Complexity of Complements, Stars, and Reversals of Regular Languages. Developments in Language Theory (2008)
Jozef Jirásek, Galina Jirásková, Alexander Szabari
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Int. J. Found. Comput. Sci. 19 (3) (2008)
Galina Jirásková, Alexander Okhotin
On the State Complexity of Operations on Two-Way Finite Automata. Developments in Language Theory (2008)
Jozef Jirásek, Galina Jirásková, Alexander Szabari
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Developments in Language Theory (2007)
Galina Jirásková
Deterministic blow-ups of minimal NFA's. RAIRO Theor. Informatics Appl. 40 (3) (2006)
Galina Jirásková
Note on the complexity of Las Vegas automata problems. RAIRO Theor. Informatics Appl. 40 (3) (2006)
Marek Hricko, Galina Jirásková, Alexander Szabari
Union and Intersection of Regular Languages and Descriptional Complexity. DCFS (2005)
Galina Jirásková
State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330 (2) (2005)
Galina Jirásková, Alexander Okhotin
State complexity of cyclic shift. DCFS (2005)
Jozef Jirásek, Galina Jirásková, Alexander Szabari
State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16 (3) (2005)

Galina Jirásková.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Galina Jirásková