Characterization of Glushkov automata

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 75-90

  Caron, Pascal ^a   Ziadi, Djelloul ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Automata theory; Glushkov automaton; Graphs theory; Regular expression

Indexed keywords

EID: 0242296053     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00296-X     Document Type: Article

References (22)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. G. Berry, R. Sethi, From regular expression to deterministic automata, Theoret. Comput. Sci. 48 (1) (1986) 117-126.
3. J. Berstel, Transductions and Context-free Languages, Teubner, Stuttgart, 1979.
4. J. Berstel, Finite automata and rational languages, an introduction, in: J.-E. Pin (Ed.), Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, vol. 386, Springer-Verlag, Berlin, 1989, pp. 2-14.
5. J. Berstel, J.-E. Pin, Local languages and the Berry-Sethi algorithm, Theoret. Comput. Sci. 155 (1996) 439-446.
6. A. Brüggemann-Klein, Regular expressions into finite automata, Theoret. Comput. Sci. 120 (1) (1993) 197-213.
7. P. Caron, AG: Manuel de l'utilisateur, Rapport LIR 96.09, Université de Rouen, France, 1996.
8. P. Caron, AG: A set of Maple packages for manipulating automata and finite semigroups, Software-Practice & Experience 27 (8) (1997) 863-884.
9. e Journées franco-belges: Théorie des Automates et Applications, Publications de l'Université de Rouen, vol. 176, 1991, pp. 29-43.
10. J.-M. Champarnaud, G. Hansel, Automate, a computing package for automata and finite semigroups, J. Symbol, Comput. 12 (1991) 197-220.
11. C.-H. Chang, R. Paige, From regular expression to DFA's using NFA's, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. 3rd Annual Symp. on Combinatorial Pattern Matching, Tucson, AZ, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1992, pp. 90-110.
12. S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
13. V.M. Glushkov, The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
14. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
15. V. Jansen, A. Potthoff, W. Thomas, U. Wermuth, A short guide to the AMoRE system (computing Automata, MOnoids and Regular Expressions), Technical Report 90.2, Aachener Informatik-Berichte, Ahornstr 55, D-5100 Aachen, 1990.
16. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkena, Report on the program AMoRE, Report, Institut für informatik und praktische mathematik, Christian-Albrechts Universität, Kiel, 1995.
17. R. McNaughton, H. Yamada, Regular expressions and state graphs for automata, IRA Trans. Electron. Comput. EC-9 (1) (1960) 39-47.
18. B.G. Mirkin, An algorithm for constructing a base in a language of regular expressions, Eng. Cybernet. 5 (1966) 110-116.
19. J.-L. Ponty, D. Ziadi, J.-M. Champarnaud, A new quadratic algorithm to convert a regular expression into an automaton, in: D. Raymond, D. Wood, S. Yu (Eds.), Automata Implementation: 1st Internat. Workshop on Implementing Automata, WIA'96, London, Ontario, Lecture Notes in Computer Science, vol. 1260, Springer, Berlin, 1997, pp. 109-119.
20. K. Thompson, Regular expression search algorithm, Comm. ACM 11 (6) (1968) 419-422.
21. B.W. Watson, A taxonomy of finite automata construction algorithms, Report, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands, 1994.
22. D. Ziadi, J.-L. Ponty, J.-M. Champarnaud, Passage d'une expression rationnelle à un automate fini non-déterministe, Bull. Belg. Math. Soc. 4 (1997) 177-203.