Pumping lemma
Home
>
Languages
>
Formal Language
>
Recursively Enumerable Languages
>
Pumping lemma
The pumping lemma is a useful tool for proving that a given language is not a regular language.