350 views
1 votes
1 votes

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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
3 answers
1
0 votes
0 votes
1 answer
3
amitarp818 asked Nov 18, 2023
235 views
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by