Computing ε-free NFA from regular expressions in O(n log2(n)) time

Theoretical Informatics and Applications

Volumn 34, Issue 4, 2000, Pages 257-277

  Hagenah, Christian ^a   Muscholl, Anca ^a,b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Common follow sets construction; Epsilon free nondeterministic automata; Regular expressions

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SEQUENTIAL MACHINES; SET THEORY;

COMMON FOLLOW SETS CONSTRUCTION; EPSILON FREE NONDETERMINISTIC FINITE AUTOMATON; REGULAR EXPRESSIONS; SEQUENTIAL ALGORITHMS;

FINITE AUTOMATA;

EID: 0034550187     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2000116     Document Type: Article

References (13)

1. G. Berry and R. Sethi, From regular expressions to deterministic automata. Theoret. Comput. Sci. 48 (1986) 117-126.
2. J. Berstel and J.-É. Pin, Local languages and the Berry-Sethi algorithm. Theoret. Comput. Sci. 155 (1996) 439-446.
3. A. Brüggemann-Klein, Regular expressions into finite automata. Theoret. Comput. Sci. 120 (1993) 197-213.
4. A. Ehrenfeucht and P. Zeiger, Complexity measures for regular expressions. J. Comput. System Sci. 12 (1976) 134-146.
5. A. Gibbons and W. Rytter, Efficient parallel algorithms. Cambridge University Press (1989).
6. V.M. Glushkov, The abstract theory of automata. Russian Math. Surveys 16 (1961) 1-53.
7. 2(n)) time, in Proc. of the 23rd Symposium on Mathematical Foundations of Computer Science (MFCS'98, Brno, Czech Rep.), edited by L. Brim et al. Springer, Lecture Notes in Comput. Sci. 1450 (1998) 277-285.
8. J. Hromkovič, S. Seibert and Th. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata, in Proc. of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97, Lübeck, Germany), edited by R. Reischuk et al. Springer, Lecture Notes in Comput. Sci. 1200 (1997) 55-66.
9. J. JáJá, An introduction to parallel algorithms. Addison-Wesley, Reading, MA (1992).
10. R. McNaughton and H. Yamada, Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. EC-9 (1960) 39-47.
11. J.-L. Ponty, D. Ziadi and J.-M. Champarnaud, A new quadratic algorithm to convert a regular expression into an automaton, in Proc. of the First International Workshop on Implementing Automata, WIA '96, edited by D. Raymond et al. Springer, Lecture Notes in Comput. Sci. 1260 (1997) 109-119.
12. D. Ziadi and J.-M. Champarnaud, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton. Theoret. Comput. Sci. 215 (1999) 69-87.
13. D. Ziadi, J.-L. Ponty and J.-M. Champarnaud, Passage d'une expression rationnelle à un automate fini non-déterministe. Bull. Belg. Math. Soc. 4 (1997) 177-203.