UMBC CMSC651, Automata Theory & Formal Languages, Fall 2010

Course Syllabus

The following schedule is a rough outline of the material to be covered during the semester. The chapters indicated are from Introduction to the Theory of Computation, by Michael Sipser.

I. Recursion/Computability Theory: 5 weeks.
HW1 assigned 09/02, due 09/09
HW2 assigned 09/09, due 09/16
HW3 assigned 09/16, due 09/23
HW4 assigned 09/23, due 09/30
Exam 1 in class 10/05

II. Basic Computational Complexity Theory: 4 weeks.
HW5 assigned 10/07, due 10/14
HW6 assigned 10/14, due 10/21
HW7 assigned 10/21, due 10/28
HW8 assigned 10/28, due 11/04
Exam 2 in class 11/09

III. Advanced Computational Complexity Theory: 4 weeks.
HW9 assigned 11/11, due 11/18
HW10 assigned 11/18, due 12/02
HW11 assigned 12/02, due 12/09
Exam 3 in class 12/21, 1pm – 3pm

Last Modified: 22 Jul 2024 11:28:45 EDT by Richard Chang
to Fall 2010 CMSC 651 Homepage