A series of four classes of formal languages whose definition in 1959 by Noam Chomsky marked the beginning of formal language theory, and that have ever since remained central to the subject. In increasing complexity they are called type 3, type 2, type 1, and type 0, each one a subclass of the next. Each type can be defined either by a class of grammars or by a class of automata, as indicated in the table. Type 0 consists of all recursively enumerable languages. Type 1 is a subclass of the languages recognizable by primitive recursive functions. Languages in types 2 and 3 can be recognized by a Turing machine in cubic and linear time, respectively.
Chomsky hierarchy.
A series of increasingly complex and comprehensive classes of formal languages. The simplest are finite state languages, followed by context-free, context-sensitive, recursive, and recursively enumerable languages. The descriptions refer to the type of formal grammar (and hence the type of computational program) needed to generate the sentences of the language.
- palaeoflow
- palaeofluminology
- Palaeogene
- palaeogeography
- palaeoguild
- Palaeohelikian
- palaeohydraulics
- palaeohydrology
- palaeo-ice streams
- palaeoichnology
- palaeolatitude
- palaeolimnology
- Palaeolithic
- palaeomagnetic dating
- palaeomagnetic pole
- palaeomagnetism
- palaeoniscids
- palaeontology
- palaeoplacer
- Palaeoproterozoic
- Palaeopterygii
- palaeoseismology
- palaeosol
- palaeosome
- palaeospecies