Let L = {ap | p is a prime}. Then which of the following is true? , ISRO 2017
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
This question is part of this quiz :
Recursively enumerable sets and Turing machines,ISRO CS 2017 December