Languages are proved to be regular using pumping lemma-04628
Languages are proved to be regular using pumping lemma
This multiple choice question (MCQ) is related to the book/course vu cs402 Theory of Automata. It can also be found in vu cs402 Final Term - Quiz No.5.