The following pages link to Macro forest transducers (Q1029068):
Displaying 14 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Definability results for top-down tree transducers (Q832950) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
