Implicit structures to implement NFA's from regular expressions

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

Volumn 2088, Issue , 2001, Pages 80-93

  Champarnaud, Jean Marc ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; PATTERN MATCHING; PIPELINE PROCESSING SYSTEMS;

CONSTRUCTION STEPS; POSITION AUTOMATON; REGULAR EXPRESSIONS; SPACE AND TIME; THOMPSON; UNDERLYING GRAPHS;

STRUCTURAL OPTIMIZATION;

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

References (15)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
2. A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120(1993), 197-213.
3. D. Beauquier, J. Berstel, and P. Chrétienne. ÉlÉments d'Algorithmique. Masson, Paris, 1992.
4. J.-M. Champarnaud, D. Ziadi and J.-L. Ponty, Determinization of Glushkov automata. In J.-M. Champarnaud et al., eds, WIA'98, Lecture Notes in Computer Science, 1660(1999), 57-68, Springer.
5. 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.
6. G. Giammarresi, J.-L. Ponty and D. Wood, The Glushkov and Thompson Machines Reexamined. Submitted.
7. V. M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1-53, 1961.
8. J. Hromkovič, S. Seibert, and T. Wilke. Translating regular expressions into small ε-free nondeterministic finite automata. In R. Reischuk and M. Morvan, eds, STACS 97, Lecture Notes in Computer Science, 1200(1997), 55-66, Springer.
9. R. F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39-57, March 1960.
10. J.-L. Ponty, D. Ziadi, and J.-M. Champarnaud. A new quadratic algorithm to convert a regular expression into an automaton. In D. Raymond et al., eds, WIA'96, Lecture Notes in Computer Science, 1260(1997), 109-119, Springer.
11. J.-L. Ponty. Algorithmique et implémentation des automates. Thése, Rouen, France, 1997.
12. J.-L. Ponty. An efficient null-free procedure for deciding regular language membership. Theoret. Comput. Sci., WIA'97 Special Issue, D. Wood and S. Yu, editors, 231(2000).
13. K. Thompson, Regular Expression Search Algorithm, Comm. Assoc. Comput. Mach. 11(1968) 419-422.
14. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Word, Language, Grammar, pages 41-110. Springer, Berlin, 1997.
15. 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.