See also:

• Computers: Computer Science: Theoretical: Automata Theory: Turing Machines  (5)

• Phrase Structure Grammars and Context Sensitive Grammars - A site which shows that the languages generated by phrase structure grammars are recursively enumerable languages. Similarly, it shows that the languages generated by context sensitive grammars are accepted by linear bounded automata.
• Recursively Enumerable Language - Wikipedia offers 3 equivalent definitions of recursively enumerable languages and states closure properties for certain operations.
• Recursively Enumerable Languages - This chapter shows that the family of regular languages is a proper subset of context free languages and the latter is a proper subset of recursively enumerable languages.
• Recursively Enumerable Languages - This site discusses denumerable sets and recursive and recursively enumerable languages
• Turing Machines and Type 0 Languages - Two theorems which show that the class of languages accepted by Turing machines is the class of Type 0 or recursively enumerable languages.