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 11 items.
- Branching synchronization grammars with nested tables (Q596320) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← 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)
- A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
- Equivalence of Deterministic Nested Word to Word Transducers (Q3183621) (← links)
- (Q4852887) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- (Q5186756) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897794) (← links)
- On the Balancedness of Tree-to-Word Transducers (Q6169900) (← links)