The following pages link to (Q5186756):
Displaying 9 items.
- Approximate consistency for transformations on words and trees (Q264563) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Deterministic acceptors for indexed languages (Q1280912) (← links)
- Equivalence problem of mappings relative to languages (Q1364102) (← links)
- Quasirelations in a free group and transformator equivalence problems (Q1820772) (← links)
- Problems of inclusion and equivalence for program schemata and formal languages (Q1895011) (← links)
- Decidability problems for meta-\(R\)-functions (Q1907768) (← links)
- Solvable problems for transformers with reversal-bounded counters (Q3747751) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)