Pages that link to "Item:Q5096729"
From MaRDI portal
The following pages link to The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729):
Displaying 4 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)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- (Q5186756) (← links)