1 votes 1 votes Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{a^nb^j : n\leq j^2\}$. 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 283 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.