Theory of Computation

This is a course in the theory of computation, a field that is considerably older than computers and computer science itself. We will look at issues related to

whatcan be algorithmically computed and what can be said about the compuational process, including time and space complexity. Although the models of computation we will use are quite concrete and easily programmed, our interest in them is primarily mathematical. We will write many proofs, just as you did in theAlgorithmsclass.

**Textbook**: __Automata Theory, Languagges, amd Computation__ by Hopcroft, Motowani, and Ullman

- HW1, due Friday, February 16
- HW 2, due Friday, February 23
- HW 3, due Friday, March 2
- HW 4, due Friday, March 9
- HW 5, due Wednesday, April 4
- HW 6, due Friday, April 13
- HW 7, due Friday, April 27
- HW 8, due Wednesday, May 9

- You may find that JFLAP (Java Formal Languages and Automata Package) from Duke University is a useful tool for drawing and simulating automata.