The following pages link to Macro tree transducers (Q1073576):
Displaying 50 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Basic tree transducers (Q579951) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Storage-to-tree transducers with look-ahead (Q706619) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Modular tree transducers (Q807012) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Macro forest transducers (Q1029068) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- On injectivity of deterministic top-down tree transducers (Q1313742) (← 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)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← 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)
- An operational and denotational approach to non-context-freeness (Q1870568) (← 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)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653) (← links)
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (Q3075482) (← links)
- Tree Transformations and Dependencies (Q3172824) (← links)
- (Q5089205) (← links)
