Theory of Computation

4.

Context-Sensitive and Unrestricted Languages

4.1.

Context-Sensitive Grammars

4.1.1.

4.1.2.

Non-contracting Productions

4.1.3.

Language Generation

4.2.

Linear Bounded Automata

4.2.1.

4.2.2.

4.2.3.

Equivalence with CSGs

4.3.

Unrestricted Grammars

4.3.1.

Type-0 Grammar Definition

4.3.2.

Phrase Structure Grammars

4.3.3.

Equivalence with Turing Machines

4.4.

Chomsky Hierarchy

4.4.1.

Type-0: Recursively Enumerable

4.4.2.

Type-1: Context-Sensitive

4.4.3.

Type-2: Context-Free

4.4.4.

Type-3: Regular

4.4.5.

Proper Inclusions

4.4.6.

Closure Properties Summary

Previous

3. Context-Free Languages

Go to top

Next

5. Turing Machines and Computability