Pumping lemma is generally used for proving

A a given grammar is regular
B a given language is not regular
C whether two given regular expressions are equivalent
D none of the above
Answer & Explanation
Option: [B]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
ADRE 3.0 Complete Study Material