Decomposing Finite-Valued Transducers and Deciding Their Equivalence

DOI10.1137/0222014zbMath0767.68079MaRDI QIDQ4037692

No author found.

Publication date: 16 May 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222014

zbMATH Keywords

equivalence problem; finite transducers; valuedness; finite valued

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Equivalence of finite-valued tree transducers is decidable, Multi-Sequential Word Relations, On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs, The Equivalence Problem of Finite Substitutions on ab*c, with Applications, A Pattern Logic for Automata with Outputs, On the containment and equivalence problems for two-way transducers, Extended symbolic finite automata and transducers, Visibly pushdown transducers, Lexicographic decomposition of \(k\)-valued transducers, Visibly Pushdown Transducers with Look-Ahead, Equivalence Checking Problem for Finite State Transducers over Semigroups, Decomposing a $k$-valued transducer into $k$ unambiguous ones, Equivalence of Finite-Valued Symbolic Finite Transducers, On the Decidability of the Equivalence for k-Valued Transducers, On the Decidability of the Equivalence for a Certain Class of Transducers