Recursive languages vs context-sensitive languages

Posted by teehoo on Stack Overflow See other posts from Stack Overflow or by teehoo
Published on 2010-06-16T21:14:21Z Indexed on 2010/06/16 21:32 UTC
Read the original article Hit count: 474

In Chomsky's hierarchy, the set of recursive languages is not defined. I know that recursive languages are a subset of recursively enumerable languages and that all recursive languages are decidable.

What I'm curious about is how recursive languages compare to context-sensitive languages. Can I assume that context-sensitive languages are a strict subset of recursive languages, and therefore all context-sensitive languages are decidable?

© Stack Overflow or respective owner

Related posts about homework

Related posts about formal-languages