Note on minimal finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 421-431

  Jirásková, Galina ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DETERMINISTIC AUTOMATA; NONDETERMINISTIC FINITE AUTOMATON;

ARTIFICIAL INTELLIGENCE;

EID: 84974715462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_37     Document Type: Conference Paper

References (8)

1. M. Chrobak: Finite automata and unary languages. Theoretical Computer Science 47(1986), 149-158
2. J. Hromkovič: Communication Complexity and Parallel Computing. Springer 1997
3. J. Hromkovič, J. Karhumäki, H. Klauck, S. Seibert, G. Schnitger: Measures on nondeterminism in finite automata. In: ICALP’00, Lecture Notes in Computer Science 1853, Springer-Verlag 2000, pp.199-210
4. K. Iwama, Y. Kambayashi and K. Takaki: Tight bounds on the number of states of DFA’s that are equivalent to n-state NFA’s. Theoretical Computer Science 237(2000) 485-494.
5. K. Iwama, A. Matsuura and M. Paterson: A family of NFA’s which need 2n − α deterministic states. Proc. MFCS’00, Lecture Notes in Computer Science 1893, Springer-Verlag 2000, pp.436-445.
6. F. Moore: On the bounds for state-set size in proofs of equivalence between deterministic, nondeterministic and two-way finite automata. IEEE Trans. Comput. C-20, pp.1211-1214, 1971
7. O. B. Lupanov: Uber der Vergleich zweier Typen endlicher Quellem. Probleme der Kybernetik, Vol.6, pp. 329-335, Akademie-Verlag, Berlin, 1966
8. M. Rabin and D. Scott: Finite automata and their decision problems. IBM J. Res. Develop, 3, pp. 114-129, 1959.