The equivalence of finite valued transducers (on HDT0L languages) is decidable
Theoretical Computer Science
On the valuedness of finite transducers
Acta Informatica
Decomposing finite-valued transducers and deciding their equivalence
SIAM Journal on Computing
Economy of description for single-valued transducers
Information and Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Sur les relations rationnelles
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Elements of Automata Theory
Lexicographic Decomposition of k-Valued Transducers
Theory of Computing Systems - Special Title: Symposium on Theoretical Aspects of Computer Science; Guest Editors: Susanne Albers, Pascal Weil
| Hi-index | 0.00 |
We give combinatorial proofs for three fundamental properties of k-valued rational relations: the decomposition of a k-valued rational relation into a union of k rational functions; the decidability of the k-valuedness; the decidability of the equivalence for k-valued rational relations. Positive answers are already known for these properties. Our contribution lies in the fact that our proofs are built on few elementary combinatorial arguments, which make them considerably shorter and hopefully easier to understand. In particular, in order to tackle the k-valuedness, we generalize a combinatorial characterization of the rational functions due to Schützenberger.