Extended Multi Bottom-Up Tree Transducers

DOI10.1007/978-3-540-85780-8_23zbMath1161.68523OpenAlexW1622003100MaRDI QIDQ3533019

Andreas Maletti, Eric Lilin, Joost Engelfriet

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition, Extended multi bottom-up tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of extended top-down tree transducers
• Increasing modularity and language-independency in automatically generated compilers
• Composition and evaluation of attribute coupled grammars
• Morphismes et bimorphismes d'arbres
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
• Syntax directed translations and the pushdown assembler
• Generalized sequential machine maps
• Linear deterministic multi bottom-up tree transducers
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
• 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