Constructing NFAs by optimal use of positions in regular expressions

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

Volumn 2373, Issue , 2002, Pages 279-288

  Ilie, Lucian ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Algorithms; Nondeterministic finite automata; Partial derivatives; Positions; Quotients; Regular expression matching; Regular expressions; Right invariant equivalence; elimination

Indexed keywords

ALGORITHMS; DATA HANDLING; FINITE AUTOMATA; NANOSTRUCTURED MATERIALS; PIPELINE PROCESSING SYSTEMS;

NONDETERMINISTIC FINITE AUTOMATON; PARTIAL DERIVATIVES; POSITIONS; QUOTIENTS; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING; RIGHT-INVARIANT EQUIVALENCE;

PATTERN MATCHING;

EID: 84937430795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_23     Document Type: Conference Paper

References (19)

1. Aho, A., Sethi, R., Ullman, J., Compilers: Principles, Techniques, and Tool s, 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., New finite automaton constructions based on canonical derivatives, Proc. of CIA A 2000, LNCS 2088, Springer, 2001, 94 -104.
7. Champarnaud, J.-M., Ziadi, D., Computing the equation automaton of a regular expression in 0(s2) space and time, Proc. of 12th Combinatorial Pattern Matching (CPM 2001), LNCS 2089, Springer, 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. Crochemore, M., Hancart, C, Automata for pattern matching, in: G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Vol. II, Springer-Verlag, Berlin, 1997, 399-462.
10. Friedl, J., Mastering Regular Expressions, O’Reilly, 1998. 279
11. Glushkov, V. M., The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
12. Hagenah, C, Muscholl, A., Computing e-free NFA from regular expressions in O(nlog2(n)) time, Theor. Inform. Appl. 34 (4) (2000) 257-277.
13. Hopcroft, J., An nlogn 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.
14. Hopcroft, J. E., Ullman, J. D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
15. Hromkovic, J., Seibert, S., Wilke, T., Translating regular expressions into small e-free nondeterministic finite automata, J. Comput. System Sci. 62 (4) (2001) 565-588.
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, New York, 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, eds., Handbook of Formal Languages, Vol. 1, Springer-Verlag, Berlin, 1997, 41-110.