Conjugacy and Equivalence of Weighted Automata and Functional Transducers
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 58-69
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Sequential?Theoretical Computer Science, 2006
- On the Equivalence of ${\mathbb Z}$ -Automata2005
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automatonTheoretical Computer Science, 2004
- A construction on finite automata that has remained hiddenTheoretical Computer Science, 1998
- An Introduction to Symbolic Dynamics and Coding1995
- Rational Series and Their Languages1988
- Rational bijection of rational setsActa Informatica, 1980
- Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnellesTheoretical Computer Science, 1977