| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 2, 2009>>> |
 Magyarul
|
Recognizable Tree Series with Discounting
Eleni Mandrali and George Rahonis
Abstract (in LaTeX format)
We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSO-logic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.
Kewords: semirings, discounting, weighted tree automata, rational operations on tree series, weighted Muller tree automata, weighted MSO-logic over finite and infinite trees.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Mandrali:2009:ActaCybernetica,author = {Eleni Mandrali and George Rahonis},
title = {Recognizable Tree Series with Discounting},
journal = {Acta Cybernetica},
volume = {19},
number= {2},
pages = {411--439},
year = {2009},
abstract = {We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSO-logic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.},
keywords = {semirings, discounting, weighted tree automata, rational operations on tree series, weighted Muller tree automata, weighted MSO-logic over finite and infinite trees}
}