Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations

DOI10.1016/j.tcs.2005.02.005zbMath1099.68051OpenAlexW2025192276MaRDI QIDQ557898

Andreas Maletti

Publication date: 30 June 2005

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

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

zbMATH Keywords

Hasse diagramSemiringTree seriesTree transducer

Mathematics Subject Classification ID

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

Related Items (2)

A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA

Cites Work

• Recognizable formal power series on trees
• The copying power of one-state tree transducers
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• Transductions des langages de Chomsky
• IO and OI. I
• IO and OI. II
• Equational elements in additive algebras
• Finite tree automata with cost functions
• Tree automata for code selection
• Tree series transformations that respect copying
• A Kleene theorem for weighted tree automata
• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations