Pumping-Lemma

Question 1

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
Theory-of-ComputationPumping-lemmaGATE 2005-IT
Question 1 Explanation: 
As we know that pumping lemma is a negative test, which can be use to disprove the given language is not regular. But reverse is not True.
There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access