The equivalence of finite valued transducers (on HDT0L languages) is decidable
Theoretical Computer Science
On the valuedness of finite transducers
Acta Informatica
On the degree of ambiguity of finite automata
Theoretical Computer Science
Decomposing finite-valued transducers and deciding their equivalence
SIAM Journal on Computing
A construction on finite automata that has remained hidden
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Sur les relations rationnelles
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Elements of Automata Theory
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Nondeterministic streaming string transducers
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Computing degree of parallelism for BPMN processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We give a new and conceptually different proof for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), without resorting to any other kind of machines than transducers. In contrast with the previous proof, our algorithm takes into account the structure of the analysed transducers and yields better complexity bounds. With the same techniques, we also present a new proof, hopefully more easily understandable, for the decidability of bounded valuedness (a result due to Weber).