Chomsky Hierarchy

A hierarchy of languages in terms of the power of the machine needed to recognize (parse) them and the complexity of the grammar that describes them: And there are languages which are are not RecursivelyEnumerable; there is no computational model (which we can build or approximate) which can recognize such a language. Also, if a set is not denumerable, can it fall under the definition of a language?

See also NoamChomsky

EditText of this page (last edited September 22, 2006) or FindPage with title or text search