Muller automaton

E2022053 UNEXPLORED

A Muller automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences based on the set of states visited infinitely often.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Muller automaton canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Rabin automaton → relatedTo → Muller automaton ⓘ