1 votes 1 votes Let $L=\{a^p\mid p \text{ is a prime}\}.$ Then which of the following is true It is not accepted by a Turing 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 Theory of Computation isrodec2017 + – gatecse asked Dec 17, 2017 recategorized Feb 11, 2018 by srestha gatecse 1.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes The language is an example of Context Sensitive Language which is not context free, therefore, it will be accepted by a Turing Machine. Option D is the correct answer. habedo007 answered Feb 8, 2018 selected Apr 16, 2018 by sourav. habedo007 comment Share Follow See all 0 reply Please log in or register to add a comment.