A lower bound on the size of ε-free NFA corresponding to a regular expression

Information Processing Letters

Volumn 85, Issue 6, 2003, Pages 293-299

  Lifshits, Yuri ^a  

^a ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

Combinatorial problems; Epsilon free nondeterministic automata; Formal languages; Regular expressions

Indexed keywords

COMBINATORIAL MATHEMATICS; FINITE AUTOMATA; PROBLEM SOLVING;

REGULAR EXPRESSIONS;

FORMAL LANGUAGES;

EID: 0037475053     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00436-2     Document Type: Article

References (3)

1. Glushkov V.M. The abstract theory of automata. Russian Math. Surveys. 16:1961;1-53. transl. Uspekhi Mat. Nauk. 16:(5(101)):1961;3-62. Correction Uspekhi Mat. Nauk. 17:(2(104)):1962;270.
2. 2(n)) time. RAIRO Theoret. Inform. Appl. 34:2000;257-277.
3. Hromkovic J., Seibert S., Wilke Th. Translating regular expressions into small ε-free nondeterministic finite automata. Reischuk R., et al. Proc. of the 14th Annual Symposium on Theoretical aspects of Computer Science (STACS'97, Lübeck, Germany). Lecture Notes in Comput. Sci. 1200:1997;55-56 Springer, Berlin.