The following pages link to (Q4210160):
Displayed 18 items.
- Branching synchronization grammars with nested tables (Q596320) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- Compositions of extended top-down tree transducers (Q948090) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Macro forest transducers (Q1029068) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Hierarchies of tree series transformations (Q1826640) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- From Tree-Based Generators to Delegation Networks (Q3522858) (← links)
- An Algebra for Tree-Based Music Generation (Q3522866) (← links)
- Monadic Datalog Tree Transducers (Q3618586) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)