The following pages link to (Q3925893):
Displaying 25 items.
- Domains of partial attributed tree transducers (Q294731) (← links)
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← 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)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- Tree Transformations and Dependencies (Q3172824) (← links)
- Monadic Datalog Tree Transducers (Q3618586) (← links)
- A two-dimensional hierarchy for attributed tree transducers (Q5055942) (← links)
- A pumping lemma for output languages of macro tree transducers (Q5878900) (← links)
- Characterizing attributed tree translations in terms of macro tree transducers (Q6104348) (← links)
- Attributed tree transducers for partial functions (Q6666800) (← links)
