Weighted Muller Tree Automata and Weighted Logics

George Rahonis

Justus-Liebig-Universität Gießen · 2007 · 29 citations · 25 references

DOIFull text

Open access

Concepts

Abstract

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.

References

25