All assignments
All challenge problems
Midterm 1
Midterm 2
[fa19] Theory of computation. Finite automata, regular languages, pushdown automata, context-free languages, and Turing machines. Undecidable problems.
MIT
All assignments
All challenge problems
Midterm 1
Midterm 2