Pumping lemma

Home > Languages > Formal Language > Finite Automata > Pumping lemma

The pumping lemma is a tool used to prove that certain languages are not regular.