Recognizable tree series with discounting
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 expres...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
2009
|
| Series: | Acta cybernetica
19 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12871 |
| Summary: | 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. |
|---|---|
| Physical Description: | 411-439 |
| ISSN: | 0324-721X |