Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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.

share|cite|improve this question
Usually you’re expected to respond with the most restrictive classification that applies. Thus, if the language is regular, you should pick regular. If it’s context-free but not regular, you should pick context-free. And so on. – Brian M. Scott Nov 29 '12 at 19:56
Ok that is probably what I am supposed to do, thanks. – Matt Nov 29 '12 at 20:00
You’re welcome. – Brian M. Scott Nov 29 '12 at 20:02

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.