Mergible states in large NFA

Theoretical Computer Science

Volumn 330, Issue 1, 2005, Pages 23-34

  Câmpeanu, Cezar ^a   Sântean, Nicolae ^b   Yu, Sheng ^b  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Equivalent states; Mergible states; Nondeterministic finite automata; Number of states

Indexed keywords

DETERMINISTIC FINITE AUTOMATA (DFA); EQUIVALENT STATES; MERGIBLE STATES; NONDETERMINISTIC FINITE AUTOMATA (NFA); NUMBER OF STATES;

ALGORITHMS; COMPUTATIONAL METHODS; FORMAL LANGUAGES; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FINITE AUTOMATA;

EID: 11444257495     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.008     Document Type: Article

References (9)

1. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York, London
2. G. Chartrand Introductory Graph Theory 1985 Dover New York
3. J.M. Harris, J.L. Hirst, and M.J. Mossinghoff Combinatorics and Graph Theory 2000 Springer New York, Berlin, Heidelberg
4. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 1st ed. 1979 Addison-Wesley Reading, MA
5. J.M. Howie An Introduction to Semigroup Theory 1976 Academic Press New York
6. D.E. Knuth, The art of computer programming, Fundamental Algorithms, Vol. 1, 3rd ed., Addison-Wesley, Reading, MA, 1997.
7. A. Salomaa Theory of Automata 1969 Pergamon Press Oxford
8. A. Salomaa Formal Languages 1973 Academic Press New York
9. S. Yu Regular languages G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. I 1997 Springer Berlin 41 110