Pages that link to "Item:Q1090467"
From MaRDI portal
The following pages link to The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467):
Displaying 30 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages (Q1177785) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- On the lengths of values in a finite transducer (Q1323379) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← 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)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- Loops in automata and HDTOL relations (Q3479541) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- (Q5090448) (← links)
- (Q5090989) (← links)
- (Q5092324) (← links)
- On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (Q5200064) (← links)
- The equivalence problem for languages defined by transductions on D0L languages (Q5462883) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)
- On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (Q5744131) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
