Descriptional Complexity of Nondeterministic Finite Automata

In this talk, I will survey recent results and discuss open problems on the state and transition complexity of nondeterministic finite automata.

[1]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[2]  Markus Holzer,et al.  Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract) , 2006, DCFS.

[3]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[4]  Arto Salomaa,et al.  State complexity of combined operations , 2007, Theor. Comput. Sci..

[5]  Markus Holzer,et al.  Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP , 2007, Developments in Language Theory.

[6]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[7]  Kai Salomaa,et al.  On the State Complexity of Combined Operations and their Estimation , 2007, Int. J. Found. Comput. Sci..

[8]  Michael Domaratzki,et al.  Lower bounds for the transition complexity of NFAs , 2008, J. Comput. Syst. Sci..

[9]  Sheng Yu,et al.  State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[10]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[11]  G. Schnitger.  Regular expressions and NFAs without ε-transitions , 2006 .

[12]  Jean-Camille Birget,et al.  Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[13]  Jeffrey Shallit,et al.  A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[14]  Juraj Hromkovic,et al.  Descriptional Complexity of Finite Automata: Concepts and Open Problems , 2002, J. Autom. Lang. Comb..

[15]  V. Rich.  Personal communication , 1989, Nature.

[16]  Michael Domaratzki,et al.  Transition complexity of language operations , 2007, Theor. Comput. Sci..

[17]  Andreas Malcher,et al.  Minimizing finite automata is computationally hard , 2004, Theor. Comput. Sci..

[18]  Markus Holzer,et al.  Computational Complexity of NFA Minimization for Finite and Unary Languages , 2007, LATA.

[19]  Martin Kutrib,et al.  Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

[20]  Markus Holzer,et al.  Finding Lower Bounds for Nondeterministic State Complexity Is Hard , 2006, Developments in Language Theory.

[21]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings , 2006, MFCS.

[22]  Georg Schnitger,et al.  Minimizing nfa's and regular expressions , 2007, J. Comput. Syst. Sci..