Use the Pumping Lemma for context-free languages to show that the following language is not context-free.
computer science
Description
(14 points) Use the Pumping Lemma for context-free languages to show that the following language is not context-free. A = {0n10n10n | n 0}
