The following pages link to (Q4027634):
Displayed 6 items.
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- On the lengths of values in a finite transducer (Q1323379) (← links)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- When is a functional tree transduction deterministic? (Q5044741) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)