Pumping Lemma
2:00
Question 1 of 2
The Pumping Lemma is generally used for proving: [GATE CS 2009]
A given grammar is ambiguous.
A given language is regular.
A given language is not regular.
A given language is context-free.
Question 1 of 2
The Pumping Lemma is generally used for proving: [GATE CS 2009]