Rational series and their languages
Rational series and their languages
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
A construction on finite automata that has remained hidden
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines
Automata, Languages, and Machines
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Axiomatizing rational power series over natural numbers
Information and Computation
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Multi-Linear Iterative K-Σ-Semialgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A coalgebraic perspective on linear weighted automata
Information and Computation
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.