Start with the topic guide.
Finite automata, formal languages, grammars, regular expressions, pushdown automata, Turing machines, computability, decidability, reductions, complexity classes, NP-completeness, approximation algorithms, and limits of computation.
This is a learning outline. A complete worked tutorial has not been published for this topic yet.
Concept scope
Theory of Computation: 13 short lessons, one for each concept. Finite automata, formal languages, grammars, regular expressions, pushdown automata, Turing machines, computability, decidability, reductions, complexity classes, NP-completeness, approximation algorithms, and limits of computation.