A family of NFAs which need 2n-α deterministic states

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 451-462

  Iwama, Kazuo ^a   Matsuura, Akihiro ^a   Paterson, Mike ^b  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Deterministic finite automaton; Magic number; Nondeterministic finite automaton; Size of automaton

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; FINITE AUTOMATA; THEOREM PROVING;

MAGIC NUMBERS;

COMPUTER SCIENCE;

EID: 0038371399     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00891-5     Document Type: Article

References (8)

1. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages and Computation. 1979;Addison-Wesley, Reading, MA.
2. Iwama K., Kambayashi Y., Takaki K. Tight bounds on the number of states of DFAs that are equivalent to. n -state NFAs Theoret. Comput. Sci. 237:2000;485-494.
3. G. Jirásková, Note on minimal finite automata, Proc. 26th Internat. Symp. Mathematical Foundations of Computer Science (MFCS2001), Bratislava, 2000, Lecture Notes in Computer Science, Vol. 2136, 2001, pp. 421-431.
4. Lewis H., Papadimitriou C. Elements of the Theory of Computation. 1981;Prentice-Hall, Englewood Cliffs, NJ.
5. O.B. Lupanov, Uber den Vergleich zweier Typen endlicher Quellen, Probleme der Kybernetik, Vol. 6, Akademie-Verlag, Berlin, 1966, pp. 329-335.
6. Moore F. 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. Rabin M., Scott D. Finite automata and their decision problems. IBM J. Res. Dev. 3:1959;114-125.
8. Salomaa A. Computation and Automata. 1985;Cambridge University Press, Cambridge.