NFAs with and without ε-transitions

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 385-396

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a ETH ZURICH   (Switzerland)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; FORMAL LANGUAGES;

COMPILERS; NONDETERMINISTIC FINITE AUTOMATON (NFA); OPTIMALITY;

AUTOMATA THEORY;

EID: 26444609078     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_32     Document Type: Conference Paper

References (5)

1. [HMU01] J.E. Hopcroft, R. Motwani, J.D. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, 2001.
2. [HSW97] J. Hromkovič, S. Seibert, and T. Wilke, Translating regular expression into small ε-free nondeterministic automata, Journal of Computer and System Sciences, 62 (4), pp. 565-588, 2001.
3. [KN97] E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, 1997.
4. [Lif03] Y. Lifshits, A lower bound on the size of ε-free NFA corresponding to a regular expression, Inf. Process. Lett. 85(6), pp. 293-299, 2003.
5. [Tho68] K. Thompson, Regular expression search, Comm. ACM 11, pp. 419-422, 1968.