Computing the equation automaton of a regular expression in O(s2) space and time

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

Volumn 2089, Issue , 2001, Pages 157-168

  Champarnaud, Jean Marc ^a   Ziadi, Djelloul ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING;

NUMBER OF STATE; PARTIAL DERIVATIVES; POSITION AUTOMATON; REGULAR EXPRESSIONS; SPACE AND TIME; SPACE AND TIME COMPLEXITY; TIME COMPLEXITY;

PATTERN MATCHING;

EID: 84956989442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_15     Document Type: Conference Paper

References (23)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
2. J.-M. Autebert et J.-M. Rifiet. Dfierivations Formelles des Expressions Rationnelles: Un Programme de Calcul Automatique. Rapport LITP 78(14), 1978.
3. V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291-319, 1996.
4. D. Beauquier, J. Berstel, and P. Chrfietienne. Éléments d'Algorithmique. Masson, Paris, 1992.
5. A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120(1993), 197-213.
6. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoret. Comput. Sci., 48(1):117-126, 1986.
7. J.A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Mach., 11(4):481-494, 1964.
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. J. -M. Champarnaud and D. Ziadi. New Finite Automaton Constructions Based on Canonical Derivatives, in CIAA'2000, Lecture Notes in Computer Science, S. Yu ed., Springer-Verlag, to appear.
10. M. Crochemore and C. Hancart. Automata for matching patterns. Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds., (A.), chap. 9, 399-462, Springer-Verlag, Berlin, 1997.
11. V.M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1-53, 1961.
12. C. 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.
13. C. Hagenah and A. Muscholl, Computing "-free NFA from Regular Expressions in O(nlog2(n)) Time, RAIRO-TIA, 34/4(2000), 257-278.
14. J. Hromkovific, 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.
15. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
16. S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34:3-41, 1956. Princeton U. Press.
17. R.F. Mc Naughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39-57, March 1960.
18. B.G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110-116, 1966.
19. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.
20. 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., Proc. WIA'96, Lecture Notes in Computer Science, Vol. 1260(1997) 109-119.
21. B. Watson, Taxonomies and Toolkits of Regular Languages Algorithms, PhD thesis, Eindhoven University of Technology, The Nederlands, 1995.
22. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, Word, Language, Grammar, pages 41-110. Springer-Verlag, Berlin, 1997.
23. D. Ziadi, J.-L. Ponty, and J.-M. Champarnaud. Passage d'une expression rationnelle à un automate un non-déterministe. Journées Montoises (1995), Bull. Belg. Math. Soc., 4:177-203, 1997.