An optimal parallel algorithm to convert a regular expression into its Glushkov automaton

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 69-87

  Ziadi, Djelloul ^a   Champarnaud, Jean Marc ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Finite automata; PRAM algorithms; Regular expressions

Indexed keywords

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

References (14)

1. I. Bar-On, U. Vishkin, Optimal parallel generation of a computation tree form, ACM Transactions on Programming Languages and Systems, 1985, pp. 348-57.
2. A. Brüggemann-Klein, Regular expressions into finite automata, Theoret. Comput. Sci. 120 (1993) 197-213.
3. C.-H. Chang, R. Paige, New theoretical and computational results for regular languages, in: Apostolico, Crochemore, Galil, and Manber (Eds.), Lecture Notes in Computer Science, vol. 644, 3rd Ann. Symp. on Combinatorial Pattern Matching Proc., Springer, Berlin, 1992, pp. 88-108.
4. A.M. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, Cambridge, MA, 1988.
5. V.M. Glushkov, The abstract theory of automata, Russian Math. Surveys 16 (1961) 1-53.
6. J.E. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
7. R. McNaughton, H. Yamada, Regular expression and state graphs for automata, IRA Trans. Electron. Comput. EC-9 1 (1960) 39-47.
8. 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 (Eds.), Lecture Notes in Computer Science, First Workshop on Implementing Automata, WIA'96 London-Ontario, Springer, Berlin, 1997, to appear.
9. W. Rytter, A note on parallel transformations of regular expressions to nondeterministic finite automata, Inform. Process. Lett. 31 (1989) 103-109.
10. R. Sedgewick, Algorithms, Addison-Wesley, Reading, MA, 1983.
11. K. Thompson, Regular expression search algorithms, Common ACM 11(6) (1968) 419-422.
12. B. Watson, Taxonomies and toolkits of regular language algorithms, CIP-DATA Koninklijke Bibliotheek, Den Haag, Ph.D. Thesis, Eindhoven University of Technology, 1995.
13. D. Ziadi, Algorithmique parallèle et séquentielle des automates, Thèse de doctorat, Université de Rouen, 1996.
14. 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.