I am currently under the believe that all regular languages are context free, thus all regular languages are recursive, and therefore all regular languages are recursively enumerable.
If I am given a question where one must select exactly one of these types of a languages for a given language L, then for each language the answer must be recursively enumerable? Am I correct in this assumption or am I missing something? Point me in the right direction if so.