Abstract
In this paper we prove Kleene’s result for formal tree series over a commutative semiring A (which is not necessarily complete or continuous or idempotent), i.e., the class of formal tree series over A which are accepted by weighted tree automata, and the class of rational tree series over A are equal. We show the result by direct automata-theoretic constructions and prove their correctness.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Droste, M., Pech, C. & Vogler, H. A Kleene Theorem for Weighted Tree Automata. Theory Comput Systems 38, 1–38 (2005). https://doi.org/10.1007/s00224-004-1096-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1096-z