Minimal NFA Problems are Hard

Finite automata (FA’s) are of fundamental importance in theory and in applications. The following basic minimization problem is studied: Given a DFA (deterministic FA), find a minimum equivalent no...

[1]  Harry B. Hunt,et al.  On the time and tape complexity of languages I , 1973, STOC.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[4]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[5]  Harry B. Hunt,et al.  Computational Parallels Between the Regular and Context-Free Languages , 1978, SIAM J. Comput..

[6]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[7]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8]  Harry B. Hunt,et al.  On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata , 1985, SIAM J. Comput..

[9]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[10]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[13]  John E. Hopcroft,et al.  Complexity of Computer Computations , 1974, IFIP Congress.

[14]  Ronald L. Rivest,et al.  Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[15]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  Tao Jiang,et al.  The Structure and Complexity of Minimal NFA's over a Unary Alphabet , 1991, FSTTCS.

[18]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[19]  R. J. Nelson,et al.  Introduction to Automata , 1968 .