in Theory of Computation
129 views
0 votes
0 votes
Show that the language $L = \{a^n : n \text{ is a prime number}\}$ is not context-free.
in Theory of Computation
129 views

Please log in or register to answer this question.

Related questions