Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Pumping lemma is generally used for proving that

(A) Given grammar is regular
(B) Given grammar is not regular
(C) Whether two given regular expressions are equivalent or not
(D) None of these
Correct answer : Option (B) - Given grammar is not regular

Share

Discusssion

Login to discuss.