retagged by
310 views

1 Answer

Best answer
3 votes
3 votes

Language Fails Pumping Lemma --> Not CFL

Pumping lemma is used to prove a given language is not CFL.Its a negative testing, you cannot prove that a language is context free by using Pumping lemma.

edited by

Related questions

0 votes
0 votes
1 answer
2
pC asked Jan 29, 2016
636 views
What is the basic Conditions for Pumping Lemma of RL and CFLI found different ans in different sourcesAlso Tell me what is a pumping length ?IS there any minimum pumping ...
0 votes
0 votes
1 answer
4
rahul sharma 5 asked Jan 13, 2017
1,629 views
True/FalsePumping lemma is generally used to prove whether given grammar is not regular.