Hierarchies of tree series transformations

DOI10.1016/j.tcs.2004.01.001zbMath1160.68409OpenAlexW2058316523MaRDI QIDQ1826640

Zsolt Gazdag, Zoltán Fülöp, Heiko Vogler

Publication date: 6 August 2004

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

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

zbMATH Keywords

Tree automataTree series transducersTree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Compositions of tree series transformations ⋮ Weighted bottom-up and top-down tree transformations are incomparable ⋮ The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition

Cites Work

• Tree transducers, L systems, and two-way machines
• Recognizable formal power series on trees
• IO and OI. I
• Equational elements in additive algebras
• Tree series transformations that respect copying
• Context-free series on trees
• 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
• Three hierarchies of transducers
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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