Class

To prove a language is not context-free using the pumping lemma you must show that every possible decomposition allowed by the lemma fails (i.e., for each decomposition there is some k for which the pumped string is not in the language).