A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids

摘要

Kleene's theorem on the equivalence of recognizability and rationality for formal tree series over distributive multioperator monoids is proved. As a consequence of this. Kleene's theorem for weighted tree automata over arbitrary, i.e.. not necessarily commutative, semirings is derived.