Justus-Liebig-Universität Gießen · 2007 · 29 citations · 25 references
ComputingComputer ScienceMathematicsFormal MethodsLogicAutomata TheoryFinite AutomataFirst-order LogicFormal Language FoundationsFormal LanguagesModel TheoryFinite Automata TheoryInfinite TreesTree AutomataWeighted AutomataWeighted Finite-state Automata
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.
25