Search the dblp DataBase

Publications of Author

1. Galina Jirásková
   Note on Minimal Automata and Uniform Communication Protocols. [Citation Graph (0, 0)][DBLP]
   Grammars and Automata for String Processing, 2003, pp:163-170 [Conf]
   
2. Galina Jirásková
   Chomsky Hierarchy and Communication Complexity. [Citation Graph (0, 0)][DBLP]
   IMYCS, 1988, pp:12-18 [Conf]
   
3. Galina Jirásková
   Note on Minimal Finite Automata. [Citation Graph (0, 0)][DBLP]
   MFCS, 2001, pp:421-431 [Conf]
   
4. Jozef Jirásek, Galina Jirásková, Alexander Szabari
   State Complexity of Concatenation and Complementation of Regular Languages. [Citation Graph (0, 0)][DBLP]
   CIAA, 2004, pp:178-189 [Conf]
   
5. Jozef Jirásek, Galina Jirásková, Alexander Szabari
   State complexity of concatenation and complementation. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:511-529 [Journal]
   
6. Galina Jirásková
   State complexity of some operations on binary regular languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:287-298 [Journal]
   
7. Jozef Jirásek, Galina Jirásková, Alexander Szabari
   Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2007, pp:254-265 [Conf]
   
8. 
   Concatenation of Regular Languages and Descriptional Complexity. [Citation Graph (, )][DBLP]
   
   
9. 
   Quotient Complexity of Closed Languages. [Citation Graph (, )][DBLP]
   
   
10. 
    On the State Complexity of Operations on Two-Way Finite Automata. [Citation Graph (, )][DBLP]
    
    
11. 
    On the State Complexity of Complements, Stars, and Reversals of Regular Languages. [Citation Graph (, )][DBLP]
    
    
12. 
    Magic Numbers and Ternary Alphabet. [Citation Graph (, )][DBLP]
    
    
13. 
    Complexity in Union-Free Regular Languages. [Citation Graph (, )][DBLP]
    
    
14. 
    Quotient Complexity of Ideal Languages. [Citation Graph (, )][DBLP]
    
    
15. 
    Converting Self-verifying Automata into Deterministic Automata. [Citation Graph (, )][DBLP]
    
    
16. 
    Nondeterministic State Complexity of Positional Addition [Citation Graph (, )][DBLP]
    
    
17. 
    Quotient complexity of ideal languages [Citation Graph (, )][DBLP]
    
    
18. 
    Quotient Complexity of Closed Languages [Citation Graph (, )][DBLP]
    
    
19. 
    Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages [Citation Graph (, )][DBLP]
    
    
20. 
    Complexity in Prefix-Free Regular Languages [Citation Graph (, )][DBLP]