Pages that link to "Item:Q4365020"
From MaRDI portal
The following pages link to Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020):
Displaying 4 items.
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
