Pages that link to "Item:Q2817401"
From MaRDI portal
The following pages link to Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401):
Displaying 6 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)
- (Q3304147) (← links)
- Equivalence of Linear Tree Transducers with Output in the Free Group (Q5041262) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)