Abstract
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. If an automaton is then sufficiently “decorated”, the combination of these two algorithms gives the desired result. Reducing the amount of “decoration” is still the object of ongoing investigation.
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
Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Computer Sci. 155, 291–319 (1996)
Arnold, A.: Systèmes de transitions finis et sémantique des processus communiquants, Masson (1992); English translation: Finite transitions systems. Prentice-Hall, Englewood Cliffs (1994)
Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Computer Sci. 48, 117–126 (1986)
Berstel, J., Pin, J.-E.: Local languages and the Berry-Sethi algorithm. Theoret. Computer Sci. 155, 439–446 (1996)
Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11, 481–494 (1964)
Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoret. Computer Sci. 233, 75–90 (2000)
Champarnaud, J.-M., Ziadi, D.: New finite automaton constructions based on canonical derivatives. In: Daley, M., Eramian, M., Yu, S. (eds.) Pre-Proceedings of CIAA 2000, Univ. of Western Ontario, pp. 36–43 (2000)
Champarnaud, J.-M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoret. Computer Sci. 289, 137–163 (2002)
Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)
Glushkov, V.: The abstract theory of automata. Russian Mathematical Surveys 16, 1–53 (1961)
Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 471–482. Springer, Heidelberg (2002)
Lombardy, S., Sakarovitch, J.: How expressions code for automata. In: TIARAIRO (to appear)
McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. on Electronic Computers 9, 39–47 (1960)
Sakarovitch, J.: A construction on automata that has remained hidden. Theoret. Computer Sci. 204, 205–231 (1998)
Thompson, K.: Regular expression search algorithm. Comm. Assoc. Comput. Mach. 11, 419–422 (1968)
Wood, D.: Theory of Computation. Wiley, Chichester (1987)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–111. Elsevier, Amsterdam (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardy, S., Sakarovitch, J. (2004). How Expressions Can Code for Automata. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive