Conference Proceedings

A Kleene theorem for weighted tree automata over tree valuation monoids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9618 452-463
DOI: 10.1007/978-3-319-30000-9_35
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cauchy unital tree valuation monoids are introduced as weight structures for weighted tree automata. Rational tree series over this kind of monoids are defined and Kleene’s classical theorem is proved for this setting: a tree series over a Cauchy unital tree valuation monoid is recognizable if and only if it is rational.

Author supplied keywords

Cite

CITATION STYLE

APA

Droste, M., Fülöp, Z., & Götze, D. (2016). A Kleene theorem for weighted tree automata over tree valuation monoids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 452–463). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free