0 votes 0 votes Show that the language $L = \{a^n : n \text{ is a prime number}\}$ is not context-free. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation pumping-lemma proof + – Rishi yadav asked Apr 15, 2019 Rishi yadav 140 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.