Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata

SIAM Journal on Computing

Volumn 27, Issue 4, 1998, Pages 1073-1082

  Leung, Hing ^a  

^a New Mexico State University   (United States)

Author keywords

Ambiguity; Nondeterministic finite automata; Succinctness of representation

Indexed keywords

EID: 0000624808     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793252092     Document Type: Article

References (2)

1. [Ha69] F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1969.
2. [HU79] J. HOPCROFT AND J. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.