The decidability of equivalence for deterministic finite transducers

DOI10.1016/0022-0000(79)90012-6zbMath0416.68073OpenAlexW2064776283MaRDI QIDQ754658

Meera Blattner, Tom Head

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90012-6

zbMATH Keywords

decidability of equivalencedeterministic finite transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

A note on finite-valued and finitely ambiguous transducers ⋮ The equivalence of finite valued transducers (on HDT0L languages) is decidable ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On the decidability of the valuedness problem for two-way finite transducers ⋮ Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ New techniques for proving the decidability of equivalence problem ⋮ On some transducer equivalence problems for families of languages ⋮ Efficient constructions of test sets for regular and context-free languages ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Single-valued a-transducers
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

This page was built for publication: The decidability of equivalence for deterministic finite transducers