Recognizable tree series with discounting
AbstractWe 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.
Download data is not yet available.
How to Cite
Mandrali, E., & Rahonis, G. (2009). Recognizable tree series with discounting. Acta Cybernetica, 19(2), 411-439. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3774