From regular expressions to finite automata

International Journal of Computer Mathematics

Volumn 72, Issue 4, 1999, Pages 415-431

  Champarnaud, J M ^a   Ponty, J L ^a   Ziadi, D ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Finite automata; Position sets; Regular expressions

Indexed keywords

FINITE AUTOMATA; FRUITS; PATTERN MATCHING;

DETERMINISTIC AUTOMATA; GLUSHKOV AUTOMATON; POSITION SETS; REGULAR EXPRESSIONS; STEP-BY-STEP METHOD;

PIPELINE PROCESSING SYSTEMS;

EID: 0042632580     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169908804865     Document Type: Article

References (38)

1. Aho, A. V., Sethi, R. and Ullman, J. D. (1986). Compilers, Addison-Wesley, pp. 113-158.
2. Antimirov, V. (1996). Partial Derivatives of Regular Expressions and Finite Automaton construction, Theoret. Comput. Sci., 155, 291-319.
3. Autebert, J.-M. (1987). Langages algébriques, Masson, Collection Etudes et Recherches en Informatique, Paris.
4. Berry, G. and Sethi, R. (1986). From Regular Expressions to Deterministic Automata, Theoret. Comput. Sci., 48, 117-126.
5. Berstel, J. (1987). Finite Automata and Rational Languages, an introduction, In: Pin, J.-E. (Ed.), Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, 386, 2-14.
6. Berstel, J. and Pin, J.-E. (1996). Local Languages and the Berry - Sethi Algorithm, Theoret. Comput. Sci., 155, 439-446.
7. Book, R., Even, S., Greibach, S. and Ott, G. (1971). Ambiguity in Graphs and Expressions, IEEE Trans. on Computers, C-20(2), 149-153.
8. Brüggemann-Klein, A. (1993). Regular Expressions into Finite Automata, Theoret. Comput. Sci., 120, 197-213.
9. Brüggemann-Klein, A. and Wood, D. (1992). Deterministic Regular Languages, In: Finkel, A. and Jantzen, M. (Eds.), Proc. STACS'92, Lecture Notes in Computer Science, 577, 173-184.
10. Brzozowski, J. A. and McCluskey, E. J. Jr. (1963). Signal Flow Graph Techniques for Sequential Circuit State Diagrams, IEEE Trans. on Electronic Computers, EC-12(2).
11. Brzozowski, J. A. (1964). Derivatives of Regular Expressions, J. ACM, 11(4), 481-494.
12. Caron, P. (1997). AG: A Set of Maple Packages of manipulating Automata and Semigroups, Software-Practice and Experience, 27(8), 863-884.
13. Caron, P. and Ziadi, D., Characterization of Glushkov Automata, to appear in Theoret. Comput. Sci.
14. Champarnaud, J.-M. (1985). Automate: Un Système de manipulation des Automates Finis, Research report LITP 85-48.
15. Champarnaud, J.-M. and Hansel, G. (1991). Automate: a Computing Package for Automata and Finite Semigroups, J. of Symb. Comp., 12, 197-220.
16. Champarnaud, J.-M., Ziadi, D. and Ponty, J.-L. (1988). Determinization of Glushkov automata, Workshop on Implementing Automata, WIA'98, Rouen, to appear in Lecture Notes in Computer Science.
17. Chang, C.-H. and Paige, R. (1992). From Regular Expressions to DFAs using NFAs, In: Apostolica, A., Crochemore, M., Galil, Z. and Manber, U. (Eds.), Proc. CPM'91, Lecture Notes in Computer Science, 664, 90-110.
18. Eilenberg, S. (1974). Automata, Languages, and machines, Vol. A, Academic Press, New York.
19. Glushkov, V. M. (1960). On a Synthesis Algorithm for Abstract Automata, (in Russian), Ukr. Matem. Zurnal, 12(2), 147-156.
20. Glushkov, V. M. (1961). The Abstract Theory of Automata, Russian Mathematical Surveys, 16, 1-53.
21. Hopcroft, J. E. and Ullman, J. D. (1979). Introduction to Automata Theory, Languages and Computation, Addison-Wesley.
22. Leiss, E. (1981). The Complexity of Restricted Regular Expressions and the Synthesis Problem of Finite Automata, J. Computer and System Sciences, 23(3), 348-354.
23. Matz, O., Miller, A., Patthoff, A., Thomas, W. and Valkena, E. (1995). Report on the Program AMoRE, Research report, Institut für informatik und praktische mathematik, Christian-Albrechts Universität, Kiel.
24. McNaughton, R. and Yamada, H. (1960). Regular Expressions and State Graphs for Automata, IRE Trans. on Electronic Computers, EC-9, 39-47.
25. Mirkin, B. G. (1966). An Algorithm for constructing a Base in a Language of Regular Expressions, (in Russian), Izv. Akak. Nauk SSSR, Techn. Kibernet, 5, 113-119. English translation in Engineering Cybernetics, 5, 110-116.
26. Mirkin, B. G. (1966). An Algorithm for constructing a Base in a Language of Regular Expressions, (in Russian), Izv. Akak. Nauk SSSR, Techn. Kibernet, 5, 113-119. English translation in Engineering Cybernetics, 5, 110-116.
27. Ponty, J.-L., Ziadi, D. and Champarnaud, J.-M. (1997). A new Quadratic Algorithm to convert a Regular Expression into an Automaton, In: Raymond, D. and Wood, D. (Eds.), Proc. WIA'96, Lecture Notes in Computer Science, 1260, 109-119.
28. Ponty, J.-L. (1997). Algorithmique et Implémentation des Automates, Contribution au Développement du Logiciel AUTOMATE. Ph.D. Thesis, LIR, Université de Rouen, France, Rapport LIR TH97.03.
29. Ponty, J.-L. (1988). An Efficient ε-free Procedure for Deciding Regular Language Membership, In: Wood, D. and Yu, S. (Eds.), Proc. WIA'97, Lecture Notes in Computer Science, 1436, 159-170.
30. Spivak, M. A. (1963). A new Algorithm for the Abstract Synthesis of Automata, (in Russian), Materiali Nauchnich Seminarov po Teoreticheskim I Prikladnim Voprosam Kiberneteki, Teoria Automatov, Kiev 3.
31. Spivak, M. A. (1965). An Algorithm for the Abstract Synthesis of Automata for an Extended Language of Regular Expressions, (in Russian), Izv. Akad. Nauk SSSR, Techn. Kibernet, 1, 51-57. English translation in Engineering Cybernetics.
32. Spivak, M. A. (1965). An Algorithm for the Abstract Synthesis of Automata for an Extended Language of Regular Expressions, (in Russian), Izv. Akad. Nauk SSSR, Techn. Kibernet, 1, 51-57. English translation in Engineering Cybernetics.
33. Thompson, K. (1968). Regular Expression Search Algorithm, Comm. Assoc. Comput. Mach., 11, 419-422.
34. Watson, B. (1995). Taxonomies and Toolkits of Regular Languages Algorithms, Ph.D. Thesis, Eindhoven University of Technology, The Nederlands.
35. Wood, D. (1987). Theory of computation, Wiley, New York.
36. Ziadi, D., Ponty, J.-L. and Champarnaud, J.-M. (1997). Passage d'une expression rationnelle à un automate fini non-déterministe, Bull. Belg. Math. Soc., 4, 177-203.
37. Ziadi, D. (1996). Algorithmique parallèle et séquentielle des automates. Ph.D. Thesis, LIR, Université de Rouen, France, Rapport LIR TH96.01.
38. Ziadi, D. and Champarnaud, J.-M., From Regular Expressions to Small NFAs, Unpublished manuscript, May 1998.