Published Online: 16 MAR 2009
Copyright © 2007 by John Wiley & Sons, Inc.
Wiley Encyclopedia of Computer Science and Engineering
How to Cite
Paun, G. 2009. Chomsky Hierarchy. Wiley Encyclopedia of Computer Science and Engineering. 396–403.
- Published Online: 16 MAR 2009
We introduce Chomsky hierarchy in a formal manner, considering first the basic classes (regular, linear, context-free, context-sensitive, and general grammars), then also introducing a sample intermediate level placed in between context-free and context-sensitive levels, the one defined by the matrix grammars and their “relatives,” the programmed and the random context grammars. A series of properties of the corresponding families of languages are also presented: characterizations and necessary conditions, closure and decidability properties, automata characterizations, and so forth.
- Chomsky grammar;
- Chomsky hierarchy;
- regular language;
- context-free language;
- context-sensitive language;
- Turing machine;
- finite automaton