Algorithms for computing small NFAs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 328-340

  Ilie, Lucian ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Algorithms; Follow relations; Invariant equivalences; Nondeterministic finite automata; Partial derivatives; Positions; Quotients; Regular expressions

Indexed keywords

ALGORITHMS; DATA HANDLING; EQUIVALENCE CLASSES; FINITE AUTOMATA; NANOSTRUCTURED MATERIALS; PATTERN MATCHING;

FOLLOW RELATIONS; INVARIANT EQUIVALENCES; NONDETERMINISTIC FINITE AUTOMATON; PARTIAL DERIVATIVES; POSITIONS; QUOTIENTS; REGULAR EXPRESSIONS;

PIPELINE PROCESSING SYSTEMS;

EID: 84956968672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Aho, A., Sethi, R., Ullman, J., Compilers: Principles, Techniques, and Tools, Addison-Wesley, MA, 1988.
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., Newfinite automaton constructions based on canonical derivatives, in: S. Yu, A. Paun, eds., Proc. of CIAA 2000, Lecture Notes in Comput. Sci. 2088, Springer-Verlag, Berlin, 2001, 94–104.
7. Champarnaud, J.-M., Ziadi, D., Computing the equation automaton of a regular expression in O(s2) space and time, in: A. Amir, G. Landau, Proc. of 12th CPM, Lecture Notes in Comput. Sci. 2089, Springer-Verlag, Berlin, 2001, 157–168.
8. Chang, C.-H., Paige, R., From regular expressions to DFA’s using compressed NFA’s, Theoret. Comput. Sci 178 (1997) 1–36.
9. Friedl, J., Mastering Regular Expressions, O’Reilly, 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 log2(n)) time, Theor. Inform. Appl. 34 (4) (2000) 257–277.
12. Hopcroft, J., An n log n algorithm for minimizing states in a finite automaton, Proc. Internat. Sympos. Theory of machines and computations, Technion, Haifa, 1971, Academic Press, New York, 1971, 189–196.
13. Hopcroft, J.E., Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
14. Hromkovic, J., Seibert, S., Wilke, T., Translating regular expressions into small _-free nondeterministic finite automata, J. Comput. System Sci. 62 (4) (2001) 565–588.
15. Ilie, L., Yu, S., Constructing NFAs by optimal use of positions in regular expressions, in: A. Apostolico, M. Takeda, Proc. of 13th CPM, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 2002, to appear.
16. McNaughton, R., Yamada, H., Regular expressions and state graphs for automata, IEEE Trans. on Electronic Computers 9 (1) (1960) 39–47.
17. Sippu, S., Soisalon-Soininen, E., Parsing Theory: I Languages and Parsing, EATCS Monographs on Theoretical Computer Science, Vol. 15, Springer-Verlag, NewY ork, 1988.
18. Thompson, K., Regular expression search algorithm, Comm. ACM 11 (6) (1968) 419–422.
19. Yu, S., Regular Languages, in: G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Vol. 1, Springer-Verlag, Berlin, 1997, 41–110.