A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead

DOI10.1016/j.ipl.2004.03.014zbMath1178.68314OpenAlexW2063683521MaRDI QIDQ2390283

Heiko Vogler, Armin Kühnemann, Zoltán Fülöp

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.014

zbMATH Keywords

formal languagestree automatatree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Linking theorems for tree transducers ⋮ Tree Transformations and Dependencies ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ Extended Multi Bottom-Up Tree Transducers ⋮ Compositions of extended top-down tree transducers ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Extended multi bottom-up tree transducers ⋮ Linear deterministic multi bottom-up tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Macro tree transducers
• Attribute grammars and recursive program schemes. I. II
• The equivalence of bottom-up and top-down tree-to-graph transducers
• The translation power of top-down tree-to-graph transducers
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Top-down tree transducers with deterministic top-down look-ahead
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Generalized sequential machine maps
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Composition of top-down and bottom-up tree transductions
• Mappings and grammars on trees

This page was built for publication: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead