in Theory of Computation
193 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 and m are both prime}\}$.
in Theory of Computation
193 views

Please log in or register to answer this question.

Related questions