☰
GkSeries.com

Q.

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]
Click Here to Read more questions apsc cce prelims 2025