New finite automaton constructions based on canonical derivatives

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

Volumn 2088, Issue , 2001, Pages 94-104

  Champarnaud, Jean Marc ^a   Ziadi, D ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL EFFICIENCY; PATTERN MATCHING;

EFFICIENT COMPUTATION; LINEAR EXPRESSION; NONDETERMINISTIC AUTOMATA; NUMBER OF STATE; PARTIAL DERIVATIVES; POSITION AUTOMATON; REGULAR EXPRESSIONS; SPACE AND TIME COMPLEXITY;

DATA HANDLING;

EID: 0141626514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_7     Document Type: Conference Paper

References (19)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
2. V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291-319, 1996.
3. D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d’Algorithmique. Masson, Paris, 1992.
4. A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120(1993), 197-213.
5. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoret. Comput. Sci., 48(1):117-126, 1986.
6. J. A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Mach., 11(4):481-494, 1964.
7. J.-M. Champarnaud and D. Ziadi, From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. Intern. Journ. of Alg. Comp., to appear.
8. C.-H. Chang and R. Paige. From Regular Expressions to DFAs using Compressed NFAs, in Apostolico. Crochemore. Galil. and Manber. editors. Lecture Notes in Computer Science, 644(1992), 88-108.
9. V. M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1-53, 1961.
10. Ch. Hagenah and A. Muscholl, Computing "-free NFA from Regular Expressions in O(nlog2(n)) Time, in: L. Prim et al. (eds.), MFCS’98, Lecture Notes in Computer Science, 1450(1998), 277-285, Springer.
11. J. Hromkovič, S. Seibert and T. Wilke, Translating regular expressions into small "-free nondeterministic finite automata, in: R. Reischuk (ed.), STACS’97, Lecture Notes in Computer Science, 1200(1997), 55-66, Springer.
12. R. F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39-57, 1960.
13. B. G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110-116, 1966.
14. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.
15. J.-L. Ponty, D. Ziadi and J.-M. Champarnaud, A new Quadratic Algorithm to convert a Regular Expression into an Automaton, In: D. Raymond and D. Wood, eds., Lecture Notes in Computer Science, 1260(1997) 109-119.
16. K. Thompson. Regular expression search algorithm. Comm. ACM, 11(6):419-422, 1968.
17. B. W. Watson. Taxonomies and Toolkit of Regular Languages Algorithms. PhD thesis, Faculty of mathematics and computing science, Eindhoven University of Technology, The Netherlands, 1995.
18. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, vol. I, 41-110. Springer-Verlag, Berlin, 1997.
19. D. Ziadi, J.-L. Ponty, and J.-M. Champarnaud. Passage d’une expression rationnelle à un automate fini non-déterministe. Journées Montoises (1995), Bull. Belg. Math. Soc., 4:177-203, 1997.