Question

Myphill Nerode  does the following:

(a) Minimization of DFA

(b) Tells us exactly when a language is regular

(c) Both (a) and (b)

(d) None of the mentioned

This question was posed to me by my college professor while I was bunking the class.

This is a very interesting question from Properties-Non Regular Languages topic in chapter Regular Expressions and Languages of Automata Theory

Answer 1

Correct option is (c) Both (a) and (b)

To explain: In automata theory, the Myphill Nerode theorem provides a necessary and sufficient condition for a language to be regular. The Myphill Nerode theorem can be used to show a language L is regular by proving that the number of equivalence classes of RL(relation) is finite.