| 2009 |
|---|
| 12 | EE | Galina Jirásková,
Giovanni Pighizzini:
Converting Self-verifying Automata into Deterministic Automata.
LATA 2009: 458-468 |
| 2008 |
|---|
| 11 | EE | Galina Jirásková:
On the State Complexity of Complements, Stars, and Reversals of Regular Languages.
Developments in Language Theory 2008: 431-442 |
| 10 | EE | Galina Jirásková,
Alexander Okhotin:
On the State Complexity of Operations on Two-Way Finite Automata.
Developments in Language Theory 2008: 443-454 |
| 9 | EE | 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) |
| 2007 |
|---|
| 8 | EE | 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 |
| 2005 |
|---|
| 7 | EE | Jozef Jirásek,
Galina Jirásková,
Alexander Szabari:
State complexity of concatenation and complementation.
Int. J. Found. Comput. Sci. 16(3): 511-529 (2005) |
| 6 | EE | Galina Jirásková:
State complexity of some operations on binary regular languages.
Theor. Comput. Sci. 330(2): 287-298 (2005) |
| 2004 |
|---|
| 5 | EE | Jozef Jirásek,
Galina Jirásková,
Alexander Szabari:
State Complexity of Concatenation and Complementation of Regular Languages.
CIAA 2004: 178-189 |
| 2003 |
|---|
| 4 | | Galina Jirásková:
Note on Minimal Automata and Uniform Communication Protocols.
Grammars and Automata for String Processing 2003: 163-170 |
| 2001 |
|---|
| 3 | EE | Galina Jirásková:
Note on Minimal Finite Automata.
MFCS 2001: 421-431 |
| 1989 |
|---|
| 2 | | Galina Kumicáková-Jirásková:
Chomsky Hierarchy and Communication Complexity.
Elektronische Informationsverarbeitung und Kybernetik 25(4): 157-164 (1989) |
| 1988 |
|---|
| 1 | | Galina Jirásková:
Chomsky Hierarchy and Communication Complexity.
IMYCS 1988: 12-18 |
