Pages that link to "Item:Q4037692"
From MaRDI portal
The following pages link to Decomposing Finite-Valued Transducers and Deciding Their Equivalence (Q4037692):
Displayed 17 items.
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- Equivalence of Finite-Valued Symbolic Finite Transducers (Q3179179) (← 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)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Multi-Sequential Word Relations (Q4640041) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (Q5200064) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)