On the Decidability of the Equivalence for a Certain Class of Transducers
From MaRDI portal
Publication:3637249
DOI10.1007/978-3-642-02737-6_39zbMath1247.68153MaRDI QIDQ3637249
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_39
68Q45: Formal languages and automata
Cites Work
- The growth ratio of synchronous rational relations is unique
- A construction on finite automata that has remained hidden
- On the lengths of values in a finite transducer
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Multitape one-way nonwriting automata
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- On the Decidability of the Equivalence for k-Valued Transducers
- On the Decidability of Bounded Valuedness for 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
- Unnamed Item
- Unnamed Item
- Unnamed Item