Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

Theoretical Computer Science

Volumn 237, Issue 1-2, 2000, Pages 485-494

  Iwama, Kazuo ^a   Kambayashi, Yahiko ^a   Takaki, Kazuya ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038212248     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00029-3     Document Type: Article

References (9)

1. A. Ambainis, The complexity of probabilistic versus deterministic finite automata, Proc. 7th ISAAC, Lecture Notes in Computer Science, Vol. 1178, Springer, Berlin, 1996, pp. 231-238.
2. P. Berman, A. Lingas, On complexity of regular languages in terms of finite automata, ICS PAS Report 304, Warszawa, 1979.
3. M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
4. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
5. H. Lewis, C. Papdimitoriou, Elements of the Theory of Computation, Prentice-Hall, Englewood Cliffs, NJ, 1981.
6. F. Moore, On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata, IEEE Trans. Comput. C-20 (1971) 1211-1214.
7. A. Nozaki, Equivalence problem of non-deterministic finite automata, J. Comput. System Sci. 18 (1979) 8-17.
8. M. Rabin, D. Scott, Finite automata and their decision problems, IBM J. Res. Dev. 3 (1959) 114-125.
9. A. Salomaa, Computation and Automata, Cambridge University Press, Cambridge, 1985.