Let L = {ap | p is a prime}. Then which of the following is true?
(A) It is not accepted by a Turing 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: (D)
Explanation: L = {ap | p is a prime}
L can only be accepted by a turing machine. So option (D) is correct.
Quiz of this Question
Article Tags :