Translating regular expressions into small ε-free nondeterministic finite automata
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n)2) in polynomial time. The best previous conversions result in NFAs of worst case size Θ(n2). Moreover, the nonexistence of any linear conversion is proved: we give a language L n described by a regular expression of size O(n) such that every NFA accepting L n is of size Ω(n log n).
Unable to display preview. Download preview PDF.
- [BEGO71]Ronald Book, Shimon Even, Sheila Greibach, and Gene Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput, C-20(2):149–153, 1971.Google Scholar
- [EZ76]Andrzej Ehrenfeucht and Paul Zeiger. Complexity measures for regular expressions. J. Comput. System Sci., 12:134–146, 1976.Google Scholar
- [HU79]John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.Google Scholar
- [MY60]Robert F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IRE Trans. Electron. Comput., EC-9(1):39–47, 1960.Google Scholar
- [RS59]Michael O. Rabin and Dana Scott. Finite automata and their decision problems. IBM J. Res. Develop., 3:114–125, 1959.Google Scholar
- [SS88]Seppo Sippu and Eljas Soisalon-Soininen. Parsing Theory, Vol. I: Languages and Parsing, volume 15 of EATCS Monographs on Theoret. Comput. Sci. Springer-Verlag, Berlin, 1988.Google Scholar