File:Chomsky-hierarchy.svg · Wikimedia Commons · See Wikimedia Commons
Chomsky hierarchy
Sign in to saveAlso known as Chomsky–Schützenberger hierarchy
containment hierarchy of classes of formal grammars
In the Vinony graph
Within Vinony's link graph, Chomsky hierarchy is referenced by 296 other articles, and connects out to finite-state machine, regular language and terminal and nonterminal symbols.
It is catalogued under topics including 1956 in computing, Formal languages and Generative linguistics.
Its subject is documented across 38 Wikipedia language editions.
Wikidata facts
Show 2 more facts
- time of discovery or invention
- 1956-00-00
- Stack Exchange tag
- cs.stackexchange.com/tags/chomsky-hierarchy
Sources (3)
via Wikidata · CC0
~9 min read
Encyclopedic overview
Set inclusions described by the Chomsky hierarchy The Chomsky hierarchy in the fields of formal language theory, computer science, and linguistics, is a containment hierarchy of classes of formal grammars. A formal grammar describes how to form strings from a formal language's alphabet that are valid according to the language's syntax. The linguist Noam Chomsky theorized that four different classes of formal grammars existed that could generate increasingly complex languages. Each class can also completely generate the language of all inferior classes (set inclusive).
History
Excerpted from Wikipedia’s “Chomsky hierarchy” article, available under the CC BY-SA 4.0 licence.