Extended multi bottom-up tree transducers

DOI10.1007/s00236-009-0105-8zbMath1186.68254OpenAlexW307669074MaRDI QIDQ1038420

Andreas Maletti, Joost Engelfriet, Eric Lilin

Publication date: 18 November 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-009-0105-8

zbMATH Keywords

tree bimorphismsxtended top-down tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Linking theorems for tree transducers ⋮ Tree Transformations and Dependencies ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition

Uses Software

• OpenFst

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
• Tree transducers, L systems, and two-way machines
• Attribute grammars and recursive program schemes. I. II
• Morphismes et bimorphismes d'arbres
• On multiple context-free grammars
• General varieties of tree languages
• Rational tree relations
• Context-free graph grammars and concatenation of graphs
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Independent parallelism in finite copying parallel rewriting systems
• 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
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
• Extended Multi Bottom-Up Tree Transducers
• The Power of Extended Top-Down Tree Transducers
• 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