GATE | Gate IT 2005 | Question 40

A language L satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about L is TRUE?

(A) L is necessarily a regular language.
(B) L is necessarily a context-free language, but not necessarily a regular language
(C) L is necessarily a non-regular language
(D) None of the above


Answer: (D)

Explanation: Pumping lemma is negativity test. We use it to disprove that a languages is not regular. But reverse is not true.

Quiz of this Question