Abstract
The aim of this paper is to compare three efficient representations of the position automaton of a regular expression: the Thompson ε-automaton, the ZPC-structure and the F-structure, an optimization of the ZPC-structure. These representations are linear w.r.t. the sizes of the expression, since their construction is in O(s) space and time, as well as the computation of the set δ(X, a) of the targets of the transitions by a of any subset X of states. The comparison is based on the evaluation of the number of edges of the underlying graphs respectively created by the construction step or visited by the computation of a set δ(X, a).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
A. Brüggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120 (1993), 197–213.
D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d’Algorithmique. Masson, Paris, 1992.
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.
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.
G. Giammarresi, J.-L. Ponty and D. Wood, The Glushkov and Thompson Machines Reexamined. Submitted.
V.M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1–53, 1961.
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.
R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–57, March 1960.
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.
J.-L. Ponty. Algorithmique et implémentation des automates. Thèse, Rouen, France, 1997.
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).
K. Thompson, Regular Expression Search Algorithm, Comm. Assoc. Comput. Mach. 11(1968) 419–422.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champarnaud, JM. (2001). Implicit Structures to Implement NFA’s from Regular Expressions. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive