Deterministic Muller Automaton

Some articles on deterministic muller, deterministic muller automaton, muller automaton:

Muller Automaton - Formal Definition
... Formally, a deterministic Muller-automaton is a tuple A = (Q,Σ,δ,q0,F) that consists of the following information Q is a finite set ... runs in which the set of infinitely often occurring states is an element of F In a non-deterministic Muller automaton, the transition function δ is replaced with a transition relation ... Generally, Muller automaton refers to non-deterministic Muller automaton ...