1,392 views
2 votes
2 votes
Could we say that

Pumping lemma is generally used to prove whether given grammar is not regular.

3 Answers

1 votes
1 votes

suppose We have some Language L

L is regular => L will support Pumping Lemma

So if language L is not supported by pumping lemma certainly then language is not regular.

so if L supports pumping lemma , no comment

but if L doesn't support pumping lemma , for sure L is non-regular...

so yes! apply pumping lemma and see language didn't support it and you have proved that language can't be regular then....it proves a language non-regular using it's negative result...

1 votes
1 votes
yes, Pumping lemma is generally used to prove whether given grammar is not regular.

bcoz  If a language satisfies pumping lemma then it may or may not be regular

but If a language does not satisfies pumping lemma , we can say language is non regular.
0 votes
0 votes

Pumping lemma is generally used to prove whether given grammar is not regular.

No. Pumping lemma is Not used to show whether the Given Grammar is Not Regular. "Pumping lemma for Regular languages" is the lemma for language, Not for Grammars.

So, We can say that Pumping lemma is Generally used to show/prove that the Given language is Not Regular ---rather than showing that It is Regular.

If the given language satisfies the condition of "Pumping lemma for Regular languages" then We can not comment about that language that whether or not it is Regular. But If the given language does not satisfy the condition of "Pumping lemma for Regular languages" then We can say that language is Not  Regular.

Related questions

0 votes
0 votes
0 answers
1
jg662 asked Feb 22
67 views
Use the Pumping Lemma to show that the following languages over Σ={�,�}Σ={a,b} are not regular. In each case, carefully describe the string that will be pumped and ...
0 votes
0 votes
1 answer
4
shallowfalcon asked Oct 17, 2022
424 views
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?