Multiple choice

Which of the following is true for the language $\left\{ a^p \text{ | p is a prime} \right\} $?

  1. It is not accepted by a Turing Machine

  2. It is regular but not context-free

  3. It is context-free but not regular

  4. It is neither regular nor context-free, but accepted by a Turing machine

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation