0 votes 0 votes Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{w\in\{a,b,c\}^*:n_a(w)+n_b(w)=2n_c(w),n_a(w) = n_b(w)\}$. 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 288 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.