Lexicographic decomposition of \(k\)-valued transducers
From MaRDI portal
Publication:1959399
DOI10.1007/s00224-009-9206-6zbMath1204.68124OpenAlexW2030798439MaRDI QIDQ1959399
Jacques Sakarovitch, Rodrigo de Souza
Publication date: 6 October 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9206-6
Related Items (11)
Visibly Pushdown Transducers with Look-Ahead ⋮ Multi-sequential Word Relations ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ A simple method for building bimachines from functional finite-state transducers ⋮ Visibly pushdown transducers ⋮ On the decidability of the valuedness problem for two-way finite transducers ⋮ Multi-Sequential Word Relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Pattern Logic for Automata with Outputs ⋮ Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational equivalence relations
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- On the valuedness of finite transducers
- Sur les rélations rationnelles entre monoides libres
- A construction on finite automata that has remained hidden
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- On the representation of finite deterministic 2-tape automata
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- On the Decidability of the Equivalence for k-Valued Transducers
- On the Decidability of Bounded Valuedness for Transducers
- A note on finite-valued and finitely ambiguous transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- On Relations Defined by Generalized Finite Automata
- Automata, Languages and Programming
This page was built for publication: Lexicographic decomposition of \(k\)-valued transducers
