A language L satisfies the Pumping Lemma for regular languages, and also the…
GATE · 2005 · IT
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
Attempted by 114 students.
Sign up free to check your answer
Sign up freeLoading lesson…