On the Decidability of the Equivalence for k-Valued Transducers

DOI10.1007/978-3-540-85780-8_20zbMATH Open1161.68556OpenAlexW1566080944MaRDI QIDQ3533016FDOQ3533016

Authors: Rodrigo de Souza 

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_20

Recommendations

• On the Decidability of the Equivalence for a Certain Class of Transducers
• On the Decidability of Bounded Valuedness for Transducers
• scientific article; zbMATH DE number 4003554
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Equivalence of finite-valued tree transducers is decidable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• On the valuedness of finite transducers
• Decomposing a $k$-valued transducer into $k$ unambiguous ones
• On the Decidability of Bounded Valuedness for Transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decomposition of \(k\)-valued rational relations
• The complexity of decision problems for finite-turn multicounter machines
• A note on finite-valued and finitely ambiguous transducers
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Title not available (Why is that?)
• Multitape one-way nonwriting automata
• A construction on finite automata that has remained hidden
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Title not available (Why is that?)
• Single-valued a-transducers

Cited In (13)

• On the Decidability of the Equivalence for a Certain Class of Transducers
• Algorithmic aspects of decomposition and equivalence of finite-valued transducers
• Title not available (Why is that?)
• On the decomposition of \(k\)-valued rational relations
• Lexicographic decomposition of \(k\)-valued transducers
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• On the decidability of the valuedness problem for two-way finite transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• Nondeterministic Streaming String Transducers
• Equivalence Checking Problem for Finite State Transducers over Semigroups
• On the Decidability of Bounded Valuedness for Transducers
• Balance of many-valued transductions and equivalence problems
• Title not available (Why is that?)

This page was built for publication: On the Decidability of the Equivalence for k-Valued Transducers

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