McNaughton's theorem
id:
mcnaughton-s-theorem-194-15011151
title:
McNaughton's theorem
text:
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. This theorem has many important consequences.
Since (non-deterministic) Büchi automata and ω-regular languages are equally expressive, the theorem implies that Büchi au
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/McNaughton%27s_theorem
date created:
date modified:
2024-01-13T04:32:27Z
main entity:
{"identifier":"Q6802493","url":"https://www.wikidata.org/entity/Q6802493"}
image:
fields total:
13
integrity:
13