Intermediate
Theory of Computation
Q44 / 100
What does the Myhill-Nerode theorem characterize?
Correct! Well done.
Incorrect.
The correct answer is B) Both the minimality of a DFA and the regularity of a language via equivalence classes of the right-congruence relation
B
Correct Answer
Both the minimality of a DFA and the regularity of a language via equivalence classes of the right-congruence relation
Explanation
Myhill-Nerode: a language is regular iff it has finitely many right-congruence classes (≡_L). The number of classes equals the number of states in the minimal DFA.
Progress
44/100