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 **honors section**!

# News

Nov 28

**Final exam**will be Thursday Dec 7 at 2pm (regular classroom)

Nov 12

HW5 posted

Oct 30

HW4 posted

Oct 18

HW3 deadline extended to Oct 23. Midterm date posted (Oct 27)

Oct 13

HW3 released

Oct 4

HW2 deadline extended to Oct 9

Oct 2

HW2 released

Sep 25

First homework is released

Sep 14

The website is ready. Let's do some CStheory!

# Materials

## Handouts

## Homeworks

- Final Problems 1, Due Sep 29
- Final Problems 2, Due Oct
~~6~~9 - Final Problems 3, Due Oct
~~20~~23 - Final Problems 4, Due Nov 6
- Final Problems 5, Due Nov 20

## Textbook

- Automata and Computability, by Dexter Kozen

## Resources

- 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)