DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA

DOI10.1142/S012905410900653XzbMath1226.68039OpenAlexW2093314863MaRDI QIDQ3634180

Torsten Stüber, Zoltán Fülöp, Heiko Vogler

Publication date: 23 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410900653x

zbMATH Keywords

decompositiontree languagestree series transformationsweighted tree automata over multioperator monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Weight Assignment Logic ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted logics for unranked tree automata ⋮ Approximated determinisation of weighted tree automata ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids ⋮ A link between multioperator and tree valuation automata and logics

Cites Work

• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
• Handbook of weighted automata
• Compositions of tree series transformations
• Weighted grammars and Kleene's theorem
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Transductions des langages de Chomsky
• Equational elements in additive algebras
• Tree series transformations that respect copying
• A Kleene theorem for weighted tree automata
• Hierarchies of tree series transformations
• Bottom-up and top-down tree transformations— a comparison
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA

This page was built for publication: DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA