Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Galina Jirásková
Galina Kumicáková-Jirásková
2010 – today
- 2013
[j16]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li: Quotient complexity of ideal languages. Theor. Comput. Sci. 470: 36-52 (2013)- [c31]
- [i5]Galina Jirásková, Tomás Masopust: On the State Complexity of the Reverse of R- and J-trivial Regular Languages. CoRR abs/1304.0733 (2013)
- 2012
- [j15]Galina Jirásková, Juraj Sebej: Reversal of binary regular languages. Theor. Comput. Sci. 449: 85-92 (2012)
- [j14]Galina Jirásková, Tomás Masopust: On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449: 93-105 (2012)
- [c30]Galina Jirásková: Descriptional Complexity of Operations on Alternating and Boolean Automata. CSR 2012: 196-204
- [c29]
- [c28]Galina Jirásková, Jeffrey Shallit: The State Complexity of Star-Complement-Star. Developments in Language Theory 2012: 380-391
- [c27]Galina Jirásková, Tomás Masopust: On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS 2012: 164-178
- [c26]Galina Jirásková, Benedek Nagy: On Union-Free and Deterministic Union-Free Languages. IFIP TCS 2012: 179-192
- [c25]Galina Jirásková, Tomás Masopust: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA 2012: 229-239
- [i4]Galina Jirásková, Jeffrey Shallit: The state complexity of star-complement-star. CoRR abs/1203.5353 (2012)
- 2011
- [j13]Galina Jirásková, Alexander Okhotin: On the State Complexity of Star of Union and Star of Intersection. Fundam. Inform. 109(2): 161-178 (2011)
- [j12]Galina Jirásková, Giovanni Pighizzini: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209(3): 528-535 (2011)
- [j11]Galina Jirásková: Magic Numbers and Ternary Alphabet. Int. J. Found. Comput. Sci. 22(2): 331-344 (2011)
- [j10]Galina Jirásková, Tomás Masopust: Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22(7): 1639-1653 (2011)
- [j9]Galina Jirásková: Concatenation of Regular Languages and Descriptional Complexity. Theory Comput. Syst. 49(2): 306-318 (2011)
- [c24]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith: Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages. AFL 2011: 123-137
- [c23]
- [c22]
- [c21]Roland Cmorik, Galina Jirásková: Basic Operations on Binary Suffix-Free Languages. MEMICS 2011: 94-102
- 2010
- [j8]Galina Jirásková, Alexander Okhotin: Nondeterministic State Complexity of Positional Addition. Journal of Automata, Languages and Combinatorics 15(1/2): 121-133 (2010)
- [c20]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou: Quotient Complexity of Closed Languages. CSR 2010: 84-95
- [c19]Galina Jirásková, Tomás Masopust: Complexity in Union-Free Regular Languages. Developments in Language Theory 2010: 255-266
- [c18]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li: Quotient Complexity of Ideal Languages. LATIN 2010: 208-221
- [c17]
- [i3]Janusz A. Brzozowski, Galina Jirásková, Joshua Smith: Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages. CoRR abs/1006.4843 (2010)
2000 – 2009
- 2009
- [c16]Galina Jirásková: Concatenation of Regular Languages and Descriptional Complexity. CSR 2009: 203-214
- [c15]
- [c14]Galina Jirásková, Giovanni Pighizzini: Converting Self-verifying Automata into Deterministic Automata. LATA 2009: 458-468
- [c13]Galina Jirásková, Pavol Olejár: State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. NCMA 2009: 151-166
- [c12]Galina Jirásková, Alexander Okhotin: Nondeterministic State Complexity of Positional Addition. DCFS 2009: 151-161
- [i2]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li: Quotient complexity of ideal languages. CoRR abs/0908.2083 (2009)
- [i1]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou: Quotient Complexity of Closed Languages. CoRR abs/0912.1034 (2009)
- 2008
- [j7]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): 617-631 (2008)
- [j6]
- [c11]Galina Jirásková: On the State Complexity of Complements, Stars, and Reversals of Regular Languages. Developments in Language Theory 2008: 431-442
- [c10]Galina Jirásková, Alexander Okhotin: On the State Complexity of Operations on Two-Way Finite Automata. Developments in Language Theory 2008: 443-454
- 2007
- [c9]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: 254-265
- 2006
- [j5]
- [j4]
- 2005
- [j3]Jozef Jirásek, Galina Jirásková, Alexander Szabari: State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16(3): 511-529 (2005)
- [j2]Galina Jirásková: State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330(2): 287-298 (2005)
- [c8]Marek Hricko, Galina Jirásková, Alexander Szabari: Union and Intersection of Regular Languages and Descriptional Complexity. DCFS 2005: 170-181
- [c7]
- 2004
- [c6]
- [c5]Jozef Jirásek, Galina Jirásková, Alexander Szabari: State Complexity of Concatenation and Complementation of Regular Languages. CIAA 2004: 178-189
- 2003
- [c4]Galina Jirásková: Note on Minimal Automata and Uniform Communication Protocols. Grammars and Automata for String Processing 2003: 163-170
- [c3]
- 2001
- [c2]
1980 – 1989
- 1989
- [j1]Galina Kumicáková-Jirásková: Chomsky Hierarchy and Communication Complexity. Elektronische Informationsverarbeitung und Kybernetik 25(4): 157-164 (1989)
- 1988
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 02:00 CEST by the dblp team