Translation of binary regular expressions into nondeterministic ε-free automata with O(n log n) transitions

Journal of Computer and System Sciences

Volumn 66, Issue 3, 2003, Pages 451-472

  Geffert, Viliam ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Descriptional complexity; Finite state automata; Formal languages; Regular expressions; Regular languages

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; THEOREM PROVING;

DESCRIPTION COMPLEXITY; REGULAR EXPRESSIONS;

FINITE AUTOMATA;

EID: 0038575684     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00036-9     Document Type: Article

References (9)

1. R. Book, S. Even, S. Greibach, G. Ott, Ambiguity in graphs and expressions, IEEE Trans. Comput. C-20 (1971) 149-153.
2. A. Ehrenfeucht, P. Zieger, Complexity measures for regular expressions, J. Comput. System Sci. 12 (1976) 134-146.
3. J. Hartmanis, P.M. Lewis II, R.E. Stearns, Memory bounds for the recognition of context free and context sensitive languages, in: IEEE Conference Record on Switching Circuit Theory and Logical Design, New York, NY, 1965. pp. 191-202.
4. J.E. Hopcroft, J.D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, MA, 1969.
5. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
6. J. Hromkovič, S. Seibert, T. Wilke, Translating regular expressions into small ε-free nondeterministic automata, in: Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science. Vol. 1200, Springer, Berlin, 1997, pp. 55-66.
7. J. Hromkovič, S. Seibert, T. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. System Sci. 62 (2001) 565-588.
8. C. Mereghetti, G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30 (2001) 1976-1992.
9. S. Sippu, E. Soisalon-Soininen, Parsing Theory, Vol. I: Languages and Parsing, in: EATCS Monographs of Theoretical Computer Science, Vol. 15, Springer, Berlin, 1988.