Top-down tree transducers with two-way tree walking look-ahead

DOI10.1016/0304-3975(92)90211-WzbMath0753.68071OpenAlexW1966434795MaRDI QIDQ1185007

Sándor Vágvölgyi

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90211-w

zbMATH Keywords

tree transformationstree automatatree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items

Yield-languages of two-way pushdown tree automata, Decidability of equivalence for deterministic synchronized tree automata, Storage-to-tree transducers with look-ahead, Decidability of equivalence for deterministic synchronized tree automata, Deciding equivalence of top-down XML transformations in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Look-ahead on pushdowns
• A complete rewriting system for a monoid of tree transformation classes
• Macro tree transducers
• Alternating tree automata
• Pushdown machines for the macro tree transducer
• High level tree transducers and iterated pushdown tree transducers
• Tree transducers, L systems, and two-way machines
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• On tree transducers for partial functions
• Top-down tree transducers with deterministic top-down look-ahead
• Generalized sequential machine maps
• Tree automata and attribute grammars
• Parallel and two-way automata on directed ordered acyclic graphs
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Three hierarchies of transducers
• Mappings and grammars on trees