Decomposing Finite-Valued Transducers and Deciding Their Equivalence
From MaRDI portal
Publication:4037692
DOI10.1137/0222014zbMath0767.68079OpenAlexW2100590693MaRDI 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
Related Items (17)
Visibly Pushdown Transducers with Look-Ahead ⋮ Equivalence of Finite-Valued Symbolic Finite Transducers ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ Equivalence of finite-valued tree transducers is decidable ⋮ Visibly pushdown transducers ⋮ On the decidability of the valuedness problem for two-way finite transducers ⋮ Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ On the containment and equivalence problems for two-way transducers ⋮ Lexicographic decomposition of \(k\)-valued transducers ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ The Equivalence Problem of Finite Substitutions on ab*c, with Applications ⋮ Multi-Sequential Word Relations ⋮ On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs ⋮ Extended symbolic finite automata and transducers ⋮ On the Decidability of the Equivalence for a Certain Class of Transducers ⋮ Decomposing a $k$-valued transducer into $k$ unambiguous ones ⋮ A Pattern Logic for Automata with Outputs
This page was built for publication: Decomposing Finite-Valued Transducers and Deciding Their Equivalence
