Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

ISRO | ISRO CS 2017 | Question 25

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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

My Personal Notes arrow_drop_up
Last Updated : 16 Mar, 2018
Like Article
Save Article
Similar Reads