Question

Which of the following is true for the language{a^P | P is a prime} and why?
(A) It is not accepted by a Turning Machine
(B) It is regular but not context-free
(C) It is context-free but not regular
(D) It is neither regular nor context-free, but accepted by a Turing machine

Answer 1

Answer on Question#38162 – Math - Other

$\{a^p | P \text{ is a prime no.}\}$

This prime no. is extra constraint so this language is neither lexical functional grammar nor regular grammar but it can be accepted by Turning Machine.

Answer: (D).