Consider the language L = {a^nb^m|n = m}; as we have seen this is not regular. Recall the definition of the equivalence L which we used in the proof of the Myhill-Nerode theorem. Since this language is not regular L cannot have finitely many equivalence classes. Exhibit explicitly, infinitely many distinct equivalence classes of L.

uestion 20 points consider the language L = (a ''Inn); as we have seen this is not regular. Recall the definition of the equivalence which we used in the proof of the Myhill-Nerode theorem. Since this language is not regular cannot have finitely many equivalence classes. Exhibit explicitly, infinitely many distinct equivalence classes of