On the Decidability of Bounded Valuedness for Transducers

DOI10.1007/978-3-540-85238-4_48MaRDI QIDQ3599160zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the Decidability of the Equivalence for k-Valued Transducers
• On the Decidability of the Equivalence for a Certain Class of Transducers
• On the decidability of the valuedness problem for two-way finite transducers
• On the valuedness of finite transducers
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• On the ambiguity and finite-valuedness problems in acceptors and transducers
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• scientific article; zbMATH DE number 4003554
• scientific article; zbMATH DE number 4060732
• Computer Science Logic

Cited in

(20)

• On the valuedness of finite transducers
• Lexicographic decomposition of \(k\)-valued transducers
• Characterizing the valuedness of two-way finite transducers
• Algorithmic aspects of decomposition and equivalence of finite-valued transducers
• On the decidability of the valuedness problem for two-way finite transducers
• Equivalence checking problem for finite state transducers over semigroups
• Nondeterministic Streaming String Transducers
• On the ambiguity, finite-valuedness, and lossiness problems in acceptors and transducers
• On the Decidability of the Equivalence for k-Valued Transducers
• Bounded Delay and Concurrency for Earliest Query Answering
• On the Decidability of the Equivalence for a Certain Class of Transducers
• On the decomposition of \(k\)-valued rational relations
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• Register Transducers Are Marble Transducers
• Queries on XML streams with bounded delay and concurrency
• On the ambiguity and finite-valuedness problems in acceptors and transducers
• A pattern logic for automata with outputs
• Decomposing finite-valued two-way finite transducers
• Finite-valued streaming string transducers
• Finite-valued streaming string transducers

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

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