Reducing NFAs by invariant equivalences

Theoretical Computer Science

Volumn 306, Issue 1-3, 2003, Pages 373-390

  Ilie, Lucian ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Automata minimization; Derivatives of regular expressions; Invariant equivalences; Non deterministic finite automata; Regular expressions

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; SPECIFICATIONS; SYNTACTICS;

REGULAR EXPRESSIONS;

FINITE AUTOMATA;

EID: 0041387624     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00311-6     Document Type: Article

References (21)

1. Aho A., Sethi R., Ullman J. Compilers: Principles, Techniques, and Tools. 1988;Addison-Wesley, Reading, MA.
2. Antimirov V. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155:1996;291-319.
3. Berry G., Sethi R. From regular expressions to deterministic automata. Theoret. Comput. Sci. 48:1986;117-126.
4. Brüggemann-Klein A. Regular expressions into finite automata. Theoret. Comput. Sci. 120:1993;197-213.
5. Brzozowski J. Derivatives of regular expressions. J. ACM. 11:1964;481-494.
6. Champarnaud J.-M., Ziadi D. New finite automaton constructions based on canonical derivatives. Yu S., Paun A. Proc. CIAA 2000. Lecture Notes in Computer Science. Vol. 2088:2001;94-104 Springer, Berlin.
7. 2) space and time Amir A., Landau G. Proc. 12th CPM. Lecture Notes in Computer Science. Vol. 2089:2001;157-168 Springer, Berlin.
8. Chang C.-H., Paige R. From regular expressions to DFA's using compressed NFA's. Theoret. Comput. Sci. 178:1997;1-36.
9. J. Friedl, Mastering Regular Expressions, O'Reilly, Sebastopol, CA, 1998.
10. Glushkov V.M. The abstract theory of automata. Russian Math. Surveys. 16:1961;1-53.
11. Hagenah C., Muscholl A. Computing. ε -free NFA from regular expressions in O(n log 2(n)) time Theor. Inform. Appl. 34(4):2000;257-277.
12. J. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, Proc. Internat. Symp. Theory of Machines and Computations, Technion, Haifa, Academic Press, New York, 1971, pp. 189-196.
13. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
14. Hromkovic J., Seibert S., Wilke T. Translating regular expressions into small. ε -free non-deterministic finite automata J. Comput. System Sci. 62(4):2001;565-588.
15. L. Ilie, S. Yu, Constructing NFAs by optimal use of positions in regular expressions, in: A. Apostolico, M. Takeda (Eds.), Proc. 13th CPM, Fukuoka, 2002, Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 279-288.
16. Ilie L., Yu S. Algorithms for computing small NFAs. Diks K., Rytter W. Proc. 27th MFCS, Warszawa, 2002. Lecture Notes in Computer Science. Vol. 2420:2002;328-340 Springer, Berlin.
17. L. Ilie, S. Yu, Follow automata, Inform. Comput., to appear.
18. McNaughton R., Yamada H. Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 9(1):1960;39-47.
19. Sippu S., Soisalon-Soininen E. Parsing Theory: I Languages and Parsing. EATCS Monographs on Theoretical Computer Science. Vol. 15:1988;Springer, New York.
20. Thompson K. Regular expression search algorithm. Comm. ACM. 11(6):1968;419-422.
21. S. Yu, Regular Languages in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. I, Springer, Berlin, 1997, pp. 41-110.