On the Decidability of Bounded Valuedness for Transducers

DOI10.1007/978-3-540-85238-4_48zbMath1173.68557OpenAlexW1601428698MaRDI QIDQ3599160

Jacques Sakarovitch, Rodrigo de Souza

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (12)

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 ⋮ Lexicographic decomposition of \(k\)-valued transducers ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ Nondeterministic Streaming String Transducers ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ On the Decidability of the Equivalence for a Certain Class of Transducers ⋮ Register Transducers Are Marble Transducers ⋮ A Pattern Logic for Automata with Outputs ⋮ Algorithmic aspects of decomposition and equivalence of finite-valued transducers

This page was built for publication: On the Decidability of Bounded Valuedness for Transducers