UMBC CMSC 651, Automata Theory & Formal Languages,
Spring 2003, Section 0101
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. Automata and Languages: 3 weeks, Chapters 0-2.
HW1 | assigned 01/30 | due 02/06 |
HW2 | assigned 02/06 | due 02/13 |
HW3 | assigned 02/13 | due 02/20 |
Test 1 | in class 02/27 |
II. Turing Machines and Computability: 5 weeks, Chapters 3-6.
HW4 | assigned 02/27 | due 03/06 |
HW5 | assigned 03/06 | due 03/13 |
HW6 | assigned 03/13 | due 03/20 |
Test 2 | in class 04/03 |
III. Complexity Theory: 5 weeks, Chapters 7-10.
HW7 | assigned 04/03 | due 04/10 |
HW8 | assigned 04/10 | due 04/17 |
HW9 | assigned 04/17 | due 04/24 |
Test 3 | in class 05/01 |
HW10 | assigned 05/01 | due 05/08 |
Final Exam: May 15, 3:30pm - 5:30pm, SS206.
Last modified: 25 Feb 2003 11:07:07 EST
by
Richard Chang,
chang@umbc.edu
to Spring 2003 CMSC 651 Homepage