A language L satisfies the Pumping Lemma for regular languages, and also the…

PYQ GATE 2005

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?  

  1. A.

    L is necessarily a regular language.

  2. B.

    L is necessarily a context-free language, but not necessarily a regular language

  3. C.

    L is necessarily a non-regular language

  4. D.

    None of the above

Attempted by 169 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…