Sponsored Links
Directory Sites
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.
www.cis.upenn.edu
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.
www.cse.ohio-state.edu
Recursively Enumerable Language
Wikipedia offers 3 equivalent definitions of recursively enumerable languages and states closure properties for certain operations.
en.wikipedia.org
Recursively Enumerable Languages
This site discusses denumerable sets and recursive and recursively enumerable languages
www.seas.upenn.edu
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.
www.cs.duke.edu