Theory of Computation
CSG Definition
Non-contracting Productions
Language Generation
LBA Definition
Tape Bounds
Equivalence with CSGs
Type-0 Grammar Definition
Phrase Structure Grammars
Equivalence with Turing Machines
Type-0: Recursively Enumerable
Type-1: Context-Sensitive
Type-2: Context-Free
Type-3: Regular
Proper Inclusions
Closure Properties Summary
Previous
3. Context-Free Languages
Go to top
Next
5. Turing Machines and Computability