Weighted Muller Tree Automata and Weighted Logics
George Rahonis · Journal of automata, languages and combinatorics · 2007
We introduce weighted Muller tree automata, over totally commutative complete semirings, acting on infinite trees. We show that their behaviours coincide with the semantics of weighted restricted MSG-sentences and the semantics of weighted incomplete universal MSG-sentences, provided that the underlying semiring is idempotent.