Abstract
We show that two equivalent \(\mathbb{K}\)-automata are conjugate to a third one, when \(\mathbb{K}\) is equal to \(\mathbb{B, N, Z}\), or any (skew) field and that the same holds true for functional tranducers as well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Béal, M.-P., Lombardy, S., Sakarovitch, J.: On the equivalence of ℤ-automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 397–409. Springer, Heidelberg (2005)
Berstel, J., Reutenauer, Ch.: Rational Series and their Languages. Springer, Heidelberg (1988)
Choffrut, Ch.: Une caractrisation des fonctions squentielles et des fonctions sous-squentielles en tant que relations rationnelles. Theoret. Comput. Sci. 5, 325–337 (1977)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)
Klimann, I., Lombardy, S., Mairesse, J., Prieur, Ch.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theoret. Comput. Sci. 327, 349–373 (2004)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Comput. Sci. (to appear)
Maurer, H., Nivat, M.: Rational Bijection of Rational Sets. Acta Informatica 13, 365–378 (1980)
Sakarovitch, J.: A construction on automata that has remained hidden. Theoret. Computer Sci. 204, 205–231 (1998)
Sakarovitch, J.: Eléments de théorie des automates, Vuibert (2003), English translation, Cambridge Universit Press (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béal, MP., Lombardy, S., Sakarovitch, J. (2006). Conjugacy and Equivalence of Weighted Automata and Functional Transducers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_9
Download citation
DOI: https://doi.org/10.1007/11753728_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)