Abstract
Reversible languages occur in many different domains. Although the decision for the membership of reversible languages was solved in 1992 by Pin, an effective construction of a reversible automaton for a reversible language was still unknown. We give in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language. With this intention, we use the universal automaton of the language that can be obtained from the minimal automaton and that contains an equivalent automaton which is quasi-reversible. This quasi-reversible automaton has nearly the same properties as a reversible one and can easily be turned into a reversible automaton.
Chapter PDF
References
A. Arnold, A. Dicky, AND M. Nivat, A note about minimal non-deterministic automata. Bull. of E.A.T.C.S. 47 (1992), 166–169.
C. J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. (Series A) 43 (1987), 81–90.
R. S. Cohen AND J. A. Brzozowski, General properties of star height of regular events, J. Computer System Sci. 4 (1970), 260–280.
J. H. Conway, Regular algebra and finite machines, Chapman and Hall, 1971.
P.-C. Héam, A lower bound for reversible automata, Theoret. Informatics Appl. 34 (2000), 331–341.
P.-C. Héam, Some topological properties of rational sets, J. of Automata, Lang, and Comb. 6 (2001), 275–290.
S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata, Proc. 5th Latin Conf., (S. Rajsbaum, Ed.), Lecture Notes in Comput. Sci. 2286 (2002).
O. Matz AND A. Potthoff, Computing small nondeterministic finite automata. Proc. TACAS’95, BRICS Notes Series (1995), 74–88.
C. Nicaud, Étude du comportement en moyenne des automates finis et des lan-gages rationnels, Thèse de doctorat, Université Paris 7, 2000.
J.-E. Pin, On reversible automata, Proc. 1st LATIN Conf., (I. Simon, Ed.), Lecture Notes in Comput. Sci. 583 (1992), 401–416.
J.-E. Pin, A variety theorem without complementation, Russian mathematics 39 (1995), 80–90.
J. Sakarovitch, Éléments de théorie des automates, Vuibert, to appear.
P.V. Silva, On free inverse monoid languages, Theoret. Informatics and Appl. 30 (1996), 349–378.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardy, S. (2002). On the Construction of Reversible Automata for Reversible Languages. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive