in Theory of Computation
187 views
0 votes
0 votes
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free.

                                                              $L=\{a^nb^jc^k : k>n,k>j\}$.
in Theory of Computation
187 views

Please log in or register to answer this question.

Related questions