Pumping lemma
Home
>
Languages
>
Formal Language
>
Regular Languages
>
Pumping lemma
A tool to prove a language is not regular.