Regular Languages
Context-Free Languages
Algorithms
Computability reductions: transfer decidability and recognizability between languages.
CFL = Context-Free · RE = Recursively Enumerable