Galina Jirásková

116 papers B 2C 23Misc 6Journal 47Unranked 35
YearRankTypeTitle / Venue / Authors
2026 J jnl
Operational Complexity in Subregular Classes.
Int. J. Found. Comput. Sci.
Michaela Bobenicová, Michal Hospodár, Galina Jirásková
2026 J jnl
State complexity of the minimal star basis.
Theor. Comput. Sci.
Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit
2025 J jnl
Conversions Between Six Models of Finite Automata.
Int. J. Found. Comput. Sci.
Michal Hospodár, Galina Jirásková
2025 J jnl
Operational complexity: NFA-to-DFA trade-off.
Inf. Comput.
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
2025 J jnl
State Complexity of Multiple Concatenation.
CoRR
Jozef Jirásek, Galina Jirásková
2024 C conf
State Complexity of the Minimal Star Basis.
CIAA
Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit
2023 C conf
Operational Complexity in Subregular Classes.
CIAA
Michal Hospodár, Galina Jirásková
2023 — conf
Operational Complexity: NFA-to-DFA Trade-Off.
DCFS
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
2023 — conf
Operations on Boolean and Alternating Finite Automata.
AFL
Galina Jirásková
2023 J jnl
Preface.
J. Autom. Lang. Comb.
Galina Jirásková, Giovanni Pighizzini
2022 J jnl
Descriptional Complexity of Formal Systems (DCFS 2019).
Inf. Comput.
Galina Jirásková, Stavros Konstantinidis
2022 J jnl
On linear languages recognized by deterministic biautomata.
Inf. Comput.
Galina Jirásková, Ondrej Klíma
2021 J jnl
Special Issue on Implementation and Application of Automata.
Theor. Comput. Sci.
Galina Jirásková, Cezar Câmpeanu
2020 — ed.
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings
DCFS
Galina Jirásková, Giovanni Pighizzini
2020 — conf
Multiple Concatenation and State Complexity (Extended Abstract).
DCFS
Jozef Jirásek, Galina Jirásková
2020 J jnl
Preface.
J. Autom. Lang. Comb.
Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2019 — ed.
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings
DCFS
Michal Hospodár, Galina Jirásková, Stavros Konstantinidis
2019 J jnl
Descriptional Complexity of the Forever Operator.
Int. J. Found. Comput. Sci.
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2019 C conf
Deterministic Biautomata and Subclasses of Deterministic Linear Languages.
LATA
Galina Jirásková, Ondrej Klíma
2019 C ed.
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings
CIAA
Michal Hospodár, Galina Jirásková
2019 — conf
NFA-to-DFA Trade-Off for Regular Operations.
DCFS
Galina Jirásková, Ivana Krajnáková
2019 J jnl
Nondeterministic complexity in subclasses of convex languages.
Theor. Comput. Sci.
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2019 J jnl
Report on CIAA 2018.
Bull. EATCS
Galina Jirásková
2019 J jnl
Square on Deterministic, Alternating, and Boolean Finite Automata.
Int. J. Found. Comput. Sci.
Galina Jirásková, Ivana Krajnáková
2019 J jnl
State complexity of unambiguous operations on finite automata.
Theor. Comput. Sci.
Galina Jirásková, Alexander Okhotin
2018 — conf
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.
Adventures Between Lower Bounds and Higher Altitudes
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2018 Misc conf
Operations on Boolean and Alternating Finite Automata.
CSR
Michal Hospodár, Galina Jirásková, Ivana Krajnáková
2018 J jnl
Operations on Unambiguous Finite Automata.
Int. J. Found. Comput. Sci.
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
2018 — conf
State Complexity of Unambiguous Operations on Deterministic Finite Automata.
DCFS
Galina Jirásková, Alexander Okhotin
2018 — ed.
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018.
NCMA
Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2018 C conf
The Exact Complexity of Star-Complement-Star.
CIAA
Jozef Jirásek, Galina Jirásková
2018 J jnl
The complexity of concatenation on deterministic and alternating finite automata.
RAIRO Theor. Informatics Appl.
Michal Hospodár, Galina Jirásková
2018 C conf
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata.
DLT
Galina Jirásková, Alexander Okhotin
2017 C conf
Nondeterministic Complexity of Operations on Free and Convex Languages.
CIAA
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2017 C conf
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.
DLT
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2017 J jnl
On the state complexity of operations on two-way finite automata.
Inf. Comput.
Galina Jirásková, Alexander Okhotin
2017 — conf
Square on Deterministic, Alternating, and Boolean Finite Automata.
DCFS
Ivana Krajnáková, Galina Jirásková
2017 — conf
Star-complement-star and Kuratowski algebras on prefix-free languages.
NCMA
Galina Jirásková, Matús Palmovský
2017 J jnl
The Complexity of Languages Resulting from the Concatenation Operation.
J. Autom. Lang. Comb.
Galina Jirásková, Alexander Szabari, Juraj Sebej
2016 — conf
Concatenation on deterministic and alternating automata.
NCMA
Michal Hospodár, Galina Jirásková
2016 C conf
Nondeterministic Complexity of Operations on Closed and Ideal Languages.
CIAA
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2016 — conf
On the State Complexity of the Shuffle of Regular Languages.
DCFS
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
2016 C conf
Operations on Unambiguous Finite Automata.
DLT
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
2016 J jnl
Prefix-free languages: Left and right quotient and reversal.
Theor. Comput. Sci.
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
2016 — conf
Self-Verifying Finite Automata and Descriptional Complexity.
DCFS
Galina Jirásková
2016 J jnl
State Complexity of Basic Operations on Non-Returning Regular Languages.
Fundam. Informaticae
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
2016 — conf
The Complexity of Languages Resulting from the Concatenation Operation.
DCFS
Galina Jirásková, Alexander Szabari, Juraj Sebej
2015 J jnl
On the State Complexity of the Shuffle of Regular Languages.
CoRR
Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula
2015 J jnl
On the boundary of regular languages.
Theor. Comput. Sci.
Jozef Jirásek, Galina Jirásková
2015 Misc conf
Operations on Self-Verifying Finite Automata.
CSR
Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari
2015 C conf
The Boundary of Prefix-Free Languages.
DLT
Jozef Jirásek, Galina Jirásková
2014 — conf
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages.
DCFS
Galina Jirásková, Peter Mlynárcik
2014 C conf
Kleene Closure on Regular and Prefix-Free Languages.
CIAA
Galina Jirásková, Matús Palmovský, Juraj Sebej
2014 — conf
On Upper and Lower Bounds on the Length of Alternating Towers.
MFCS (1)
Stepan Holub, Galina Jirásková, Tomás Masopust
2014 J jnl
On Upper and Lower Bounds on the Length of Alternating Towers.
CoRR
Galina Jirásková, Tomás Masopust
2014 C conf
On the Square of Regular Languages.
CIAA
Kristína Cevorová, Galina Jirásková, Ivana Krajnáková
2014 — conf
Operations on Automata with All States Final.
AFL
Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej
2014 — conf
Prefix-Free Languages: Right Quotient and Reversal.
DCFS
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
2014 J jnl
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages.
Acta Cybern.
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith
2014 J jnl
Quotient Complexity of Closed Languages.
Theory Comput. Syst.
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
2014 J jnl
The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages.
Int. J. Found. Comput. Sci.
Galina Jirásková
2013 Misc conf
Cyclic Shift on Prefix-Free Languages.
CSR
Jozef Jirásek, Galina Jirásková
2013 — conf
Kleene Closure and State Complexity.
ITAT
Galina Jirásková, Matús Palmovský
2013 C conf
On the Boundary of Regular Languages.
CIAA
Jozef Jirásek, Galina Jirásková
2013 — conf
On the State Complexity of the Reverse of - and -Trivial Regular Languages.
DCFS
Galina Jirásková, Tomás Masopust
2013 J jnl
On the State Complexity of the Reverse of R- and J-trivial Regular Languages
CoRR
Galina Jirásková, Tomás Masopust
2013 J jnl
Quotient complexity of ideal languages.
Theor. Comput. Sci.
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
2013 — conf
State Complexity of Basic Operations on Non-returning Regular Languages.
DCFS
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
2012 — conf
Descriptional Complexity of Biautomata.
DCFS
Galina Jirásková, Ondrej Klíma
2012 Misc conf
Descriptional Complexity of Operations on Alternating and Boolean Automata.
CSR
Galina Jirásková
2012 — conf
On Properties and State Complexity of Deterministic State-Partition Automata.
IFIP TCS
Galina Jirásková, Tomás Masopust
2012 — conf
On Union-Free and Deterministic Union-Free Languages.
IFIP TCS
Galina Jirásková, Benedek Nagy
2012 J jnl
On a structural property in the state complexity of projected regular languages.
Theor. Comput. Sci.
Galina Jirásková, Tomás Masopust
2012 C conf
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs.
CIAA
Galina Jirásková, Tomás Masopust
2012 J jnl
Reversal of binary regular languages.
Theor. Comput. Sci.
Galina Jirásková, Juraj Sebej
2012 C conf
The State Complexity of Star-Complement-Star.
Developments in Language Theory
Galina Jirásková, Jeffrey O. Shallit
2012 J jnl
The state complexity of star-complement-star
CoRR
Galina Jirásková, Jeffrey O. Shallit
2011 — conf
Basic Operations on Binary Suffix-Free Languages.
MEMICS
Roland Cmorik, Galina Jirásková
2011 J jnl
Complexity in Union-Free Regular Languages.
Int. J. Found. Comput. Sci.
Galina Jirásková, Tomás Masopust
2011 J jnl
Concatenation of Regular Languages and Descriptional Complexity.
Theory Comput. Syst.
Galina Jirásková
2011 J jnl
Magic Numbers and Ternary Alphabet.
Int. J. Found. Comput. Sci.
Galina Jirásková
2011 — conf
Note on Reversal of Binary Regular Languages.
DCFS
Galina Jirásková, Juraj Sebej
2011 J jnl
On the State Complexity of Star of Union and Star of Intersection.
Fundam. Informaticae
Galina Jirásková, Alexander Okhotin
2011 J jnl
Optimal simulation of self-verifying automata by deterministic automata.
Inf. Comput.
Galina Jirásková, Giovanni Pighizzini
2011 — conf
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages.
AFL
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith
2011 — conf
State Complexity of Projected Languages.
DCFS
Galina Jirásková, Tomás Masopust
2010 — conf
Complexity in Prefix-Free Regular Languages
DCFS
Galina Jirásková, Monika Krausová
2010 C conf
Complexity in Union-Free Regular Languages.
Developments in Language Theory
Galina Jirásková, Tomás Masopust
2010 J jnl
Nondeterministic State Complexity of Positional Addition.
J. Autom. Lang. Comb.
Galina Jirásková, Alexander Okhotin
2010 J jnl
Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages
CoRR
Janusz A. Brzozowski, Galina Jirásková, Joshua Smith
2010 Misc conf
Quotient Complexity of Closed Languages.
CSR
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
2010 B conf
Quotient Complexity of Ideal Languages.
LATIN
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
2009 Misc conf
Concatenation of Regular Languages and Descriptional Complexity.
CSR
Galina Jirásková
2009 C conf
Converting Self-verifying Automata into Deterministic Automata.
LATA
Galina Jirásková, Giovanni Pighizzini
2009 C conf
Magic Numbers and Ternary Alphabet.
Developments in Language Theory
Galina Jirásková
2009 — conf
Nondeterministic State Complexity of Positional Addition
DCFS
Galina Jirásková, Alexander Okhotin
2009 J jnl
Quotient Complexity of Closed Languages
CoRR
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou
2009 J jnl
Quotient complexity of ideal languages
CoRR
Janusz A. Brzozowski, Galina Jirásková, Baiyu Li
2009 — conf
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity.
NCMA
Galina Jirásková, Pavol Olejár
2008 J jnl
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.
Int. J. Found. Comput. Sci.
Jozef Jirásek, Galina Jirásková, Alexander Szabari
2008 C conf
On the State Complexity of Complements, Stars, and Reversals of Regular Languages.
Developments in Language Theory
Galina Jirásková
2008 C conf
On the State Complexity of Operations on Two-Way Finite Automata.
Developments in Language Theory
Galina Jirásková, Alexander Okhotin
2008 J jnl
State complexity of cyclic shift.
RAIRO Theor. Informatics Appl.
Galina Jirásková, Alexander Okhotin
2007 C conf
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.
Developments in Language Theory
Jozef Jirásek, Galina Jirásková, Alexander Szabari
2006 J jnl
Deterministic blow-ups of minimal NFA's.
RAIRO Theor. Informatics Appl.
Galina Jirásková
2006 J jnl
Note on the complexity of Las Vegas automata problems.
RAIRO Theor. Informatics Appl.
Galina Jirásková
2005 J jnl
State complexity of concatenation and complementation.
Int. J. Found. Comput. Sci.
Jozef Jirásek, Galina Jirásková, Alexander Szabari
2005 — conf
State complexity of cyclic shift.
DCFS
Galina Jirásková, Alexander Okhotin
2005 J jnl
State complexity of some operations on binary regular languages.
Theor. Comput. Sci.
Galina Jirásková
2005 — conf
Union and Intersection of Regular Languages and Descriptional Complexity.
DCFS
Marek Hricko, Galina Jirásková, Alexander Szabari
2004 C conf
State Complexity of Concatenation and Complementation of Regular Languages.
CIAA
Jozef Jirásek, Galina Jirásková, Alexander Szabari
2004 — conf
The Complexity of Las Vegas Automata Problems.
DCFS
Galina Jirásková
2003 — conf
Note on Minimal Automata and Uniform Communication Protocols.
Grammars and Automata for String Processing
Galina Jirásková
2003 — conf
State Complexity of Some Operations on Regular Languages.
DCFS
Galina Jirásková
2001 B conf
Note on Minimal Finite Automata.
MFCS
Galina Jirásková
1988 — conf
Chomsky Hierarchy and Communication Complexity.
IMYCS
Galina Jirásková