0 votes 0 votes Show that the language $L = \Big\{ a^{n^2} :n\geq 0\Big\}$ is not context free. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation pumping-lemma proof context-free-language + – Rishi yadav asked Apr 15, 2019 Rishi yadav 297 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.