in Theory of Computation
206 views
1 vote
1 vote

A language L satisfies the pumping lemma for context-free languages but doesn’t satisfy the pumping lemma for regular language.
Which of the following statement about L is true?

a)L is necessarily a context-free language

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

C)L is necessarily a non-context free language

d)None of the above

dout why option c is wrong

in Theory of Computation
206 views

3 Comments

edited by
pumping lemma is not a sufficient condition to decide if it is cfl or not. if pumping lemma is satisfied, the language may or may not be cfl. here we can't say if L is cfl or not but it is definitely not regular as pumping lemma is a necessary condition.
0
0
ok means pumping lemma not satisfy  then definitely it is not that language
0
0
correct.
0
0

Please log in or register to answer this question.