Conjugacy and Equivalence of Weighted Automata and Functional Transducers
作者： Marie-Pierre Béal , Sylvain Lombardy , Jacques Sakarovitch
DOI: 10.1007/11753728_9
关键词:
摘要: We show that two equivalent $\mathbb{K}$-automata are conjugate to a third one, when $\mathbb{K}$ is equal $\mathbb{B, N, Z}$, or any (skew) field and the same holds true for functional tranducers as well.
springer.com
core.ac.uk
archives-ouvertes.fr
springerlink.com参考文章(10)
Sylvain Lombardy, Jacques Sakarovitch, Marie-Pierre Béal, On the Equivalence of -Automata. international colloquium on automata, languages and programming. pp. 397- 409 ,(2005)
Jean Berstel, Christophe Reutenauer, Rational Series and Their Languages ,(1988)
Douglas A. Lind, Brian Marcus, An Introduction to Symbolic Dynamics and Coding ,(2010)
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton developments in language theory. ,vol. 327, pp. 349- 373 ,(2004) , 10.1016/J.TCS.2004.02.049
Jacques Sakarovitch, A construction on finite automata that has remained hidden Theoretical Computer Science. ,vol. 204, pp. 205- 231 ,(1998) , 10.1016/S0304-3975(98)00040-1
Christian Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles Theoretical Computer Science. ,vol. 5, pp. 325- 337 ,(1977) , 10.1016/0304-3975(77)90049-4
H. A. Maurer, M. Nivat, Rational bijection of rational sets Acta Informatica. ,vol. 13, pp. 365- 378 ,(1980) , 10.1007/BF00288770
Samuel Eilenberg, Automata, Languages, and Machines Academic Press, Inc.. ,(1974)
Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch, On the equivalence of Z -automata international colloquium on automata languages and programming. pp. 397- 409 ,(2005) , 10.1007/11523468_33