Pumping lemma is generally used to prove that-04903
Pumping lemma is generally used to prove that:
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Mid Term - Quiz No.11.
Pumping lemma is generally used to prove that:
A given language is infinite
A given language is not regular
Whether two given regular expressions of a=regular language are equivalent or not
None of these
