in Theory of Computation
290 views
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)\}$.
in Theory of Computation
290 views

Please log in or register to answer this question.

Related questions