Pages that link to "Item:Q3126010"
From MaRDI portal
The following pages link to Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010):
Displaying 10 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- On the Decidability of the Equivalence for a Certain Class of Transducers (Q3637249) (← links)
- (Q5092324) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
