Source: wikibot/myhill-nerode-theorem
= Myhill–Nerode theorem
{wiki=Myhill–Nerode_theorem}
The Myhill–Nerode theorem is a fundamental result in formal language theory that provides a characterization of regular languages in terms of equivalence relations on strings. It offers a method to determine whether a language is regular and to construct the minimal deterministic finite automaton (DFA) that recognizes a given regular language.