A Kleene theorem for weighted tree automata

DOI10.1007/s00224-004-1096-zzbMath1061.68092OpenAlexW2068478937MaRDI QIDQ1764423

Heiko Vogler, Christian Pech, Manfred Droste

Publication date: 24 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1096-z

zbMATH Keywords

formal tree series over a commutative semiring

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

A note on cut-worthiness of recognizable tree series ⋮ Weighted tree automata and weighted logics ⋮ Unnamed Item ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Cut sets as recognizable tree languages ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ A Kleene Theorem for Forest Languages ⋮ Kleene and Büchi theorems for weighted forest languages over M-monoids ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Automatic Termination ⋮ Principal abstract families of weighted tree languages ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ A link between multioperator and tree valuation automata and logics

This page was built for publication: A Kleene theorem for weighted tree automata