The decidability of equivalence for deterministic finite transducers

DOI10.1016/0022-0000(79)90012-6zbMATH Open0416.68073OpenAlexW2064776283MaRDI QIDQ754658FDOQ754658

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)

Cites Work

• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Title not available (Why is that?)
• Single-valued a-transducers

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754658)