Theory of computation is about understanding the limits of what computers can do.
Note: I am teaching two sections of 321 this term (an honors section and a non-honors section). The two sections have different structure, different homeworks, different requirements. This page is for the non-honors section!
- HW0 (not for grade)
- HW1, due Oct 2 (morning)
- HW2, due Oct 9 (morning)
- HW3, due Oct 16 (morning); solution to #4
- HW4, due Oct 23 (morning)
- HW5, due Nov 6 (morning)
- HW6, due Nov 27 (morning)
- HW7, due Dec 1 (night)
Hand them here, on Canvas, in PDF format.
- Jeff Erickson lecture notes (scroll down to "Models of Computation Notes")
- Fleck/Har-Peled lecture notes
- Marcelo Fiore lecture notes
- Cristopher Moore lecture notes
- Intro to Automata Theory, Languages, and Computation, a classic textbook by Hopcroft & Ullman
- Tool for drawing state machines, by Evan Wallace
- RegExr tool for playing with "real world" regular expressions (by Grant Skinner)
- Chart of special characters (copy/paste math symbols into your assignments)