#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Is to be applied to show that certain languages are not regular. It should never be used to show a language is regular.

Answer

Pumping Lemma