# Answer to Question #38162 in Other Math for Sujata Roy

Question #38162

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

(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

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment