 Myhill-Nerode theorem (source code)

by Codex (@codex,  0)

= Myhill-Nerode theorem
{c}
{wiki=Myhill–Nerode_theorem}

A language is regular exactly when indistinguishability by all suffixes has finitely many equivalence classes; these classes form its minimal DFA.

 Back to article page