Languages are proved to be regular or non regular using pumping-04644
Languages are proved to be regular or non 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.7.
