A lower bound technique for the size of nondeterministic finite automata

Information Processing Letters

Volumn 59, Issue 2, 1996, Pages 75-77

  Glaister, Ian ^a,b   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Array Systems Computing Inc   (Canada)

Author keywords

Formal languages; Lower bound; Nondeterministic finite automata

Indexed keywords

EID: 11844290244     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00095-6     Document Type: Article

References (9)

1. A. Arnold, A. Dicky and M. Nivat, A note about minimal non-deterministic automata, Bull. European Assoc. Theoret. Comput. Sci. 47 (1992) 166-169.
2. I. Glaister and J. Shallit, Automaticity III: Polynomial automaticity, context-free languages, and fixed points of morphisms, Manuscript, 1995.
3. I. Glaister and J. Shallit, Polynomial automaticity, context-free languages and fixed points of morphisms, in: Proc. of MFCS '96 (1996), to appear.
4. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
5. T. Jiang, E. McDowell and B. Ravikumar, The structure and complexity of minimal NFA's over a unary alphabet, Internat. J. Found. Comput. Sci. 2 (1991) 163-182.
6. T. Jiang and B. Ravikumar, NFA minimization problems are hard, SIAM J. Comput. 22 (1993) 1117-1141.
7. T. Kameda and P. Weiner, On the state minimization of nondeterministic finite automata, IEEE Trans. Comput. 19 (1970) 617-627.
8. J. Kim, State minimization of nondeterministic machines, Tech. Rept. RC 4896, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974.
9. O. Matz and A. Potthoff, Computing small nondeterministic finite automata, in: U.H. Engberg, K.G. Larsen and A. Skou, eds., Proc. of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, BRICS Notes Series (May 1995) 74-88.