Sign in Get started

Theory of Computation

Chapters

1. Finite Automata

DFA, NFA, equivalence, minimization.

2. Regular Languages

Regex, pumping lemma, closure properties.

3. Context-Free Languages

CFG, PDA, Chomsky normal form.

4. Turing Machines

Computability, decidability, halting problem.