I know that the pumping lemma is not powerful enough to prove a language is not context-free, but I don't understand how to show it.
I have the same question as this oneShow that the Pumping Lemma for CFLs is not powerful enough to prove that the language L = {aibjck |i ≠j ≠ k ≠ i } is not context free, but I couldn't understand the answer in this.
Please explain to me in detail,how can I show $L = \{ a^i b^j c^k | i ≠ j ≠ k ≠ i \}$ satisfy the pumping lemma?
