356 views

1 Answer

3 votes
3 votes
If pumping lemma not setisfy for regular ,means Language is not Regular .

Since pumping lemma satisfy for CFL , we cant comment it is CFL or not so we can only say Language is not regular but may be CFL nut not always CFL.,

Related questions

0 votes
0 votes
1 answer
4
Jaideep Singh asked Nov 28, 2022
271 views
Consider the following statement:S : {$a^{n}b^{n+k} | n\geq 0,k\geq 1$} $\cup$ {$a^{n+k}b^{n} | n\geq 0,k\geq 3$}Which of the following is TRUE about S? (Also explain HOW...