Problem Set 1: Definitions, Proofs, Finite Automata [PDF] [LaTeX template] — due Tuesday, 2 February [Comments PDF]
Problem Set 2: NFAs, Regular Languages, PDAs, and Grammars [PDF] [LaTeX template] — due Tuesday, 16 February [Comments PDF]
Problem Set 3: Context-Free Languages [PDF] [LaTeX template] — due Tuesday, 23 February [Comments PDF]
Problem Set 4: Turing Machines [PDF] [LaTeX template] — due Tuesday, 23 March [Comments PDF]
Problem Set 5: Undecidability [PDF] [LaTeX template] — due Tuesday, 6 April [Comments PDF]
Problem Set 6: Complexity [PDF] [LaTeX template] — due Tuesday, 27 April [Comments PDF]
Problem Set 7: Conveying Complexity [PDF] — due Tuesday, 4 May [Submissions and Highlights]