1. Formal grammars (Type 0, 1, 2, 3 — Chomsky hierarchy)

2. Regular languages & expressions

3. Finite-State Automata (FSA)

4. Finite-State Transducers (FST)

5. Context-Free Grammars (CFG)

6. Pushdown Automata (PDA)

7. Context-Sensitive Grammars

8. Turing Machines (concept)

9. Decidability & computational limits

10. Relation to linguistic levels