The Chomsky Hierarchy (11.

4)
• The Chomsky Hierarchy
• Extending the Chomsky Hierarchy
• A Random-Access Machine
• The Turing Tar-Pit
 The Chomsky Hierarchy
• The Chomsky hierarchy, as originally defined by Noam Chomsky,
comprises four types of languages and their associated grammars
and machines.

• These languages form a strict hierarchy; that is:

regular languages  context-free languages  context-
sensitive languages  recursively enumerable languages.
The Chomsky Hierarchy
 Extending the Chomsky Hierarchy

• Besides those in the "classical" Chomsky hierarchy. We can have

other languages that can also fit into this hierarchy.
– note that deterministic pushdown automata were less powerful than
nondeterministic pushdown automata.
 Extending the Chomsky Hierarchy

• Not all language classes fit neatly into a hierarchy. For example, we
have discussed the linear languages, which (like deterministic
context-free languages) fit neatly between the regular languages
and the context-free languages;
• however, there are languages that are linear but not deterministic
context-free, and there are languages that are deterministic context-
free but not linear.

• In fact, mathematicians have defined dozens, maybe hundreds, of

different classes of languages, and write papers on how these relate
to one another. You should know at least the four "classic"
categories that are taught in almost every textbook on the subject.
 Chomsky’s Extended hierarchy

This hierarchy includes the families of deterministic context-

free languages(LDCF) and recursive languages (LREC)
Relationship between regular, linear, deterministic
context-free, and nondeterministic context-free
languages