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
The answer to the question is available in the PDF file https://assignmentexpert.com/https://assignmentexpert.com/homework-answers/mathematics-answer-38162.pdf
Comments
Leave a comment