Skip to content
Related Articles

Related Articles

Improve Article
UGC-NET | UGC-NET CS 2017 Nov – III | Question 21
  • Last Updated : 19 Mar, 2018

Pumping lemma for regular language is generally used for proving:
(A) whether two given regular expressions are equivalent
(B) a given grammar is ambiguous
(C) a given grammar is regular
(D) a given grammar is not regular

Answer: (D)

Explanation: Pumping lemma is used to prove a language is regular or not.
For more information on pumping lemma Refer:Pumping_lemma
So, option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :