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

                                               $L = \{a^nb^m: \text{n is prime and m is not prime}\}$.
in Theory of Computation
352 views

Please log in or register to answer this question.

Related questions