-
Which of the following is true for the language {ap | p is a prime}?
-
- It is not accepted by a turning machine
- It is regular but not context-free
- It is context-free but not regular
- It is neither regular nor context-free, but accepted by a turing machine
- It is not accepted by a turning machine
Correct Option: D
{ aP Pis a prime no. }
This prime no. is extra constraint so this language is neither LFG nor RG but it can be accepted by turing machine.
