The decidability of equivalence for deterministic finite transducers

DOI10.1016/0022-0000(79)90012-6MaRDI QIDQ754658zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• Single-valued a-transducers
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Cited in

(9)

• Efficient constructions of test sets for regular and context-free languages
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• The many facets of string transducers (invited talk)
• Equivalence checking problem for finite state transducers over semigroups
• On some transducer equivalence problems for families of languages
• On the decidability of the valuedness problem for two-way finite transducers
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• New techniques for proving the decidability of equivalence problem
• 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)