In automata theory, McNaughton's theorem refers to a theorem that asserts that the set of ω-regular languages is identical to the set of languages recognizable by deterministic Muller automata.This theorem is proven by supplying an algorithm to construct a deterministic Muller automaton for any ω-regular language and vice versa.