Abstract
We present an extension to multiplicities of a classical algorithm for computing a boolean automaton from a regular expression. The Glushkov construction computes an automaton with n + 1 states from a regular expression with n occurences of letters. We show that the Glushkov algorithm still suits to the multiplicity case. Next, we give three equivalent extended step by step algorithm
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
P. Andary, P. Caron, J.-M. Champarnaud, G. Duchamp, M. Flouret, and E. Laugerotte. Sea: A symbolic environment for automata theory. In Automata Implementation: Fourth International Workshop on Implementing Automata, WIA’99, Lecture Notes in Computer Science, 1999. To be published.
G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoret. Comput. Sci., 48(1):117–126, 1986.
J. Berstel and C. Reutenauer. Rational series and their languages. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.
J.-M. Champarnaud and G. Hansel. Automate, a computing package for automata and finite semigroups. J. Symbolic Comput., 12:197–220, 1991.
K. CulikII and J. Kari. Finite state transformations of images. In Proceedings of ICALP 95, volume 944. Lecture Notes in Computer Science, 1995.
G. Duchamp, M. Flouret, and_ E. Laugerotte. Operations over automata with multiplicities. In J.-M. Champarnaud and D. Ziadi, editors, Automata Implementation: Third International Workshop on Implementing Automata, WIA’98, volume 1660 of Lecture Notes in Computer Science, pages 183–191, 1999.
S. Eilenberg. Automata, languages and machines, volume A. Academic Press, New York, 1974.
M. Flouret. Contribution à l’algorithmique non commutative. PhD thesis, Université de Rouen, 1999.
V.M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1–53, 1961.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
V. Jansen, A. Potthoff, W. Thomas, and U. Wermuth. A short guide to the AMoRE system (computing Automata, MOnoids and Regular Expressions). Technical Report 90.2, Aachener Informatik-Berichte, Ahornstr 55, D5100 Aachen, 1990.
S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34:3–41, 1956. Princeton U. Press.
R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–57, March 1960.
B.G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110–116, 1966.
D. Raymond and D. Wood. Grail, a C++ library for automata and expressions. J. Symbolic Comput., 17:341–350, 1994.
M.P. Schützenberger. On the definition of a family of automata. Inform. and Control, 4:245–270, 1961.
K. Thompson. Regular expression search algorithm. Comm. ACM, 11(6):419–422, 1968.
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: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
Caron, P., Flouret, M. (2001). Glushkov Construction for Multiplicities. 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_5
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_5
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