Muller automaton

From Wikipedia, the free encyclopedia

You have new messages (last change).

A Muller automaton is a type of finite automaton accepting infinite strings. The acceptance condition is represented by a set C \subseteq 2^S of subsets of the states. The automaton accepts a run iff the set of states occurring infinitely many times in the run belongs to C.

Büchi automata, parity automata, Rabin automata, and Streett automata are all subclasses of Muller automata.

Soft Eng logo This computer language-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../m/u/l/Muller_automaton.html"