Chomsky Hierarchy and Communication Complexity. - Galina Kumicáková-Jirásková (J. Inf. Process. Cybern., 1989)

Note on Minimal Finite Automata. - Galina Jirásková (MFCS, 2001)

Note on Minimal Automata and Uniform Communication Protocols. - Galina Jirásková (Grammars and Automata for String Processing, 2003)

State Complexity of Some Operations on Regular Languages. - Galina Jirásková (DCFS, 2003)

The Complexity of Las Vegas Automata Problems. - Galina Jirásková (DCFS, 2004)

State Complexity of Concatenation and Complementation of Regular Languages. - Jozef Jirásek 001; Galina Jirásková; Alexander Szabari (CIAA, 2004)

Union and Intersection of Regular Languages and Descriptional Complexity. - Marek Hricko; Galina Jirásková; Alexander Szabari (DCFS, 2005)

State complexity of concatenation and complementation. - Jozef Jirásek 001; Galina Jirásková; Alexander Szabari (Int. J. Found. Comput. Sci., 2005)

State complexity of some operations on binary regular languages. - Galina Jirásková (Theor. Comput. Sci., 2005)

Deterministic blow-ups of minimal NFA's. - Galina Jirásková (RAIRO Theor. Informatics Appl., 2006)

Note on the complexity of Las Vegas automata problems. - Galina Jirásková (RAIRO Theor. Informatics Appl., 2006)

On the State Complexity of Complements, Stars, and Reversals of Regular Languages. - Galina Jirásková (Developments in Language Theory, 2008)

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. - Jozef Jirásek 001; Galina Jirásková; Alexander Szabari (Int. J. Found. Comput. Sci., 2008)

State complexity of cyclic shift. - Galina Jirásková; Alexander Okhotin (RAIRO Theor. Informatics Appl., 2008)

Converting Self-verifying Automata into Deterministic Automata. - Galina Jirásková; Giovanni Pighizzini (LATA, 2009)

State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. - Galina Jirásková; Pavol Olejár (NCMA, 2009)

Nondeterministic State Complexity of Positional Addition - Galina Jirásková; Alexander Okhotin (DCFS, 2009)

Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages - Janusz A. Brzozowski; Galina Jirásková; Joshua Smith 001 (CoRR, 2010)

Complexity in Prefix-Free Regular Languages - Galina Jirásková; Monika Krausová (DCFS, 2010)

State Complexity of Projected Languages. - Galina Jirásková; Tomás Masopust (DCFS, 2011)

Note on Reversal of Binary Regular Languages. - Galina Jirásková; Juraj Sebej (DCFS, 2011)

Basic Operations on Binary Suffix-Free Languages. - Roland Cmorik; Galina Jirásková (MEMICS, 2011)

On the State Complexity of Star of Union and Star of Intersection. - Galina Jirásková; Alexander Okhotin (Fundam. Informaticae, 2011)

Optimal simulation of self-verifying automata by deterministic automata. - Galina Jirásková; Giovanni Pighizzini (Inf. Comput., 2011)

Magic Numbers and Ternary Alphabet. - Galina Jirásková (Int. J. Found. Comput. Sci., 2011)

Complexity in Union-Free Regular Languages. - Galina Jirásková; Tomás Masopust (Int. J. Found. Comput. Sci., 2011)

Concatenation of Regular Languages and Descriptional Complexity. - Galina Jirásková (Theory Comput. Syst., 2011)

Descriptional Complexity of Operations on Alternating and Boolean Automata. - Galina Jirásková (CSR, 2012)

Descriptional Complexity of Biautomata. - Galina Jirásková; Ondrej Klíma 001 (DCFS, 2012)

The State Complexity of Star-Complement-Star. - Galina Jirásková; Jeffrey O. Shallit (Developments in Language Theory, 2012)

On Properties and State Complexity of Deterministic State-Partition Automata. - Galina Jirásková; Tomás Masopust (IFIP TCS, 2012)

On Union-Free and Deterministic Union-Free Languages. - Galina Jirásková; Benedek Nagy (IFIP TCS, 2012)

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. - Galina Jirásková; Tomás Masopust (CIAA, 2012)

On a structural property in the state complexity of projected regular languages. - Galina Jirásková; Tomás Masopust (Theor. Comput. Sci., 2012)

Reversal of binary regular languages. - Galina Jirásková; Juraj Sebej (Theor. Comput. Sci., 2012)

Cyclic Shift on Prefix-Free Languages. - Jozef Jirásek 001; Galina Jirásková (CSR, 2013)

On the State Complexity of the Reverse of - and -Trivial Regular Languages. - Galina Jirásková; Tomás Masopust (DCFS, 2013)

Kleene Closure and State Complexity. - Galina Jirásková; Matús Palmovský (ITAT, 2013)

On the State Complexity of the Reverse of R- and J-trivial Regular Languages - Galina Jirásková; Tomás Masopust (CoRR, 2013)

Quotient complexity of ideal languages. - Janusz A. Brzozowski; Galina Jirásková; Baiyu Li (Theor. Comput. Sci., 2013)

Prefix-Free Languages: Right Quotient and Reversal. - Jozef Jirásek 001; Galina Jirásková; Monika Krausová; Peter Mlynárcik; Juraj Sebej (DCFS, 2014)

Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. - Galina Jirásková; Peter Mlynárcik (DCFS, 2014)

On Upper and Lower Bounds on the Length of Alternating Towers. - Stepan Holub; Galina Jirásková; Tomás Masopust (MFCS (1), 2014)

On the Square of Regular Languages. - Kristína Cevorová; Galina Jirásková; Ivana Krajnáková (CIAA, 2014)

Kleene Closure on Regular and Prefix-Free Languages. - Galina Jirásková; Matús Palmovský; Juraj Sebej (CIAA, 2014)

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages. - Janusz A. Brzozowski; Galina Jirásková; Baiyu Li; Joshua Smith 001 (Acta Cybern., 2014)

Operations on Automata with All States Final. - Kristína Cevorová; Galina Jirásková; Peter Mlynárcik; Matús Palmovský; Juraj Sebej (AFL, 2014)

On Upper and Lower Bounds on the Length of Alternating Towers. - Galina Jirásková; Tomás Masopust (CoRR, 2014)

The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages. - Galina Jirásková (Int. J. Found. Comput. Sci., 2014)

Quotient Complexity of Closed Languages. - Janusz A. Brzozowski; Galina Jirásková; Chenglong Zou (Theory Comput. Syst., 2014)

Operations on Self-Verifying Finite Automata. - Jozef Stefan Jirásek; Galina Jirásková; Alexander Szabari (CSR, 2015)

The Boundary of Prefix-Free Languages. - Jozef Jirásek 001; Galina Jirásková (DLT, 2015)

On the boundary of regular languages. - Jozef Jirásek 001; Galina Jirásková (Theor. Comput. Sci., 2015)

On the State Complexity of the Shuffle of Regular Languages. - Janusz A. Brzozowski; Galina Jirásková; Bo Liu 092; Aayush Rajasekaran; Marek Szykula (DCFS, 2016)

Self-Verifying Finite Automata and Descriptional Complexity. - Galina Jirásková (DCFS, 2016)

Concatenation on deterministic and alternating automata. - Michal Hospodár; Galina Jirásková (NCMA, 2016)

Nondeterministic Complexity of Operations on Closed and Ideal Languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (CIAA, 2016)

State Complexity of Basic Operations on Non-Returning Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Galina Jirásková (Fundam. Informaticae, 2016)

Prefix-free languages: Left and right quotient and reversal. - Jozef Jirásek 001; Galina Jirásková; Monika Krausová; Peter Mlynárcik; Juraj Sebej (Theor. Comput. Sci., 2016)

On the Descriptive Complexity of $$ overline{ varSigma ^* overline{L}}$$. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (DLT, 2017)

Star-complement-star and Kuratowski algebras on prefix-free languages. - Galina Jirásková; Matús Palmovský (NCMA, 2017)

Nondeterministic Complexity of Operations on Free and Convex Languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (CIAA, 2017)

On the state complexity of operations on two-way finite automata. - Galina Jirásková; Alexander Okhotin (Inf. Comput., 2017)

The Complexity of Languages Resulting from the Concatenation Operation. - Galina Jirásková; Alexander Szabari; Juraj Sebej (J. Autom. Lang. Comb., 2017)

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Operations on Boolean and Alternating Finite Automata. - Michal Hospodár; Galina Jirásková; Ivana Krajnáková (CSR, 2018)

State Complexity of Unambiguous Operations on Deterministic Finite Automata. - Galina Jirásková; Alexander Okhotin (DCFS, 2018)

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. - Galina Jirásková; Alexander Okhotin (DLT, 2018)

The Exact Complexity of Star-Complement-Star. - Jozef Jirásek 001; Galina Jirásková (CIAA, 2018)

Operations on Unambiguous Finite Automata. - Jozef Jirásek Jr.; Galina Jirásková; Juraj Sebej (Int. J. Found. Comput. Sci., 2018)

The complexity of concatenation on deterministic and alternating finite automata. - Michal Hospodár; Galina Jirásková (RAIRO Theor. Informatics Appl., 2018)

NFA-to-DFA Trade-Off for Regular Operations. - Galina Jirásková; Ivana Krajnáková (DCFS, 2019)

Deterministic Biautomata and Subclasses of Deterministic Linear Languages. - Galina Jirásková; Ondrej Klíma 001 (LATA, 2019)

Report on CIAA 2018. - Galina Jirásková (Bull. EATCS, 2019)

Descriptional Complexity of the Forever Operator. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Int. J. Found. Comput. Sci., 2019)

Square on Deterministic, Alternating, and Boolean Finite Automata. - Galina Jirásková; Ivana Krajnáková (Int. J. Found. Comput. Sci., 2019)

Nondeterministic complexity in subclasses of convex languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Theor. Comput. Sci., 2019)

State complexity of unambiguous operations on finite automata. - Galina Jirásková; Alexander Okhotin (Theor. Comput. Sci., 2019)

Multiple Concatenation and State Complexity (Extended Abstract). - Jozef Jirásek 001; Galina Jirásková (DCFS, 2020)

Preface. - Michal Hospodár; Galina Jirásková; Giovanni Pighizzini (J. Autom. Lang. Comb., 2020)

Special Issue on Implementation and Application of Automata. - Galina Jirásková; Cezar Câmpeanu (Theor. Comput. Sci., 2021)

Descriptional Complexity of Formal Systems (DCFS 2019). - Galina Jirásková; Stavros Konstantinidis (Inf. Comput., 2022)

On linear languages recognized by deterministic biautomata. - Galina Jirásková; Ondrej Klíma 001 (Inf. Comput., 2022)

Operational Complexity: NFA-to-DFA Trade-Off. - Michal Hospodár; Jozef Jirásek 001; Galina Jirásková; Juraj Sebej (DCFS, 2023)

Operational Complexity in Subregular Classes. - Michal Hospodár; Galina Jirásková (CIAA, 2023)

Operations on Boolean and Alternating Finite Automata. - Galina Jirásková (AFL, 2023)

Preface. - Galina Jirásková; Giovanni Pighizzini (J. Autom. Lang. Comb., 2023)

State Complexity of the Minimal Star Basis. - Jozef Jirásek 001; Galina Jirásková; Jeffrey O. Shallit (CIAA, 2024)

Conversions Between Six Models of Finite Automata. - Michal Hospodár; Galina Jirásková (Int. J. Found. Comput. Sci., 2025)