## A Kleene theorem for weighted tree automata (2002)

by
Manfred Droste
,
Heiko Vogler

Venue: | Theory of Computing Systems |

Citations: | 17 - 8 self |

### BibTeX

@ARTICLE{Droste02akleene,

author = {Manfred Droste and Heiko Vogler},

title = {A Kleene theorem for weighted tree automata},

journal = {Theory of Computing Systems},

year = {2002},

volume = {38},

pages = {1--38}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we prove Kleene's result for tree series over a commutative and idempotent semiring A (which is not necessarily complete or continuous), i.e., the class of recognizable tree series over A and the class of rational tree series over A are equal. We show the result by direct automata-theoretic constructions and prove their correctness.