โ All free certificatesFree learning path Final step
Theory of Computation
10 short modules. Each one: a simple lesson, two quick games and a 8-question quiz for its own free certificate. Finish them all, then take the full Theory of Computation certificate.
0 of 10 module certificates
- Alphabets, strings and languagesThe vocabulary of automata theory.0/4
- Deterministic finite automataDFA: machines with finite memory.0/4
- NFA and equivalenceNondeterminism and subset construction.0/4
- Regular expressionsDescribing regular languages with patterns.0/4
- Properties of regular languagesPumping lemma, closure and minimisation.0/4
- Context-free grammarsGrammars, derivations and parse trees.0/4
- Pushdown automataFinite automata with a stack.0/4
- Turing machinesThe model of general computation.0/4
- DecidabilityProblems no algorithm can solve.0/4
- Complexity: P and NPHow hard decidable problems are.0/4
๐ Full Theory of Computation certificate
20 questions from basic to advanced, 60% to pass. Best taken after the modules.