I was reading through HOPCROFT and had difficulty applying the pumping motto in a formal way to the exercises to prove that a language is not regular.
In this case, I mean the Pumping Lemma for regular languages.
In some cases I have been able to show specific cases, but my teacher only accepts general tests in the evaluation.