Compositions of tree series transformations

DOI10.1016/j.tcs.2006.08.026zbMath1154.68074OpenAlexW2156032599MaRDI QIDQ860891

Andreas Maletti

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.026

zbMATH Keywords

compositionsemiringtree transducertree series transformation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (8)

PURE AND O-SUBSTITUTION ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Equational weighted tree transformations ⋮ Characterizing weighted MSO for trees by branching transitive closure logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizable formal power series on trees
• IO and OI. I
• Equational elements in additive algebras
• Tree automata for code selection
• Tree series transformations that respect copying
• Hierarchies of tree series transformations
• Context-free series on trees
• Generalized sequential machine maps
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions
• On the Determinization of Weighted Finite Automata
• Implementation and Application of Automata
• Developments in Language Theory
• Mappings and grammars on trees

This page was built for publication: Compositions of tree series transformations