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

**Note**: My office hours during Reading Period will be somewhat restricted. I will be available

Wednesday 12/12 1:30-4:30

Thursday 12/13 9:30-1:30

Friday 12/14 9:30-10:30

All day Monday 12/17 and Tuesday 12/18

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

- Exam 1 Topics
- Last Semester's Exam 1
- Solutions to Last Semester's Exam 1

- Solutions to this semester's Exam 1

- Exam 2 Topics
- Last Semester's Exam 2
- Solutions to Last Semester's Exam 2
- Solutions to this semester's Exam 2

- HW1, due Monday, September 17
- HW2, due Monday, September 24
- HW3, due Monday, October 1 Here are my solutions to t his.
- HW4, due Wednesday, October 10 Solutions
- HW 5, due Wednesday, October 31 Solutions
- HW 6, due Monday, November 12 Solutions
- HW 6B, due Friday, November 9 Solutions
- HW 7, due Monday, November 26 Solutions
- HW 8 (and last), due Friday, December 7 Solutions