UMBC CMSC 651, Automata Theory & Formal Languages,
Spring 2003, Section 0101
Course Syllabus (Revised)
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.
Note: Due to the blizzard, the syllabus has been revised. The
original syllabus is still available.
I. Automata and Languages: 3.5 weeks, Chapters 0-2.
II. Turing Machines and Computability: 5 weeks, Chapters 3-6.
III. Complexity Theory: 4 weeks, Chapters 7-10.
Homework & Test Schedule
|HW1||assigned 01/30||due 02/06
|HW2||assigned 02/06||due 02/13
|HW3||assigned 02/13||due 02/27
|HW4||assigned 02/27||due 03/06
|Test 1||in class 03/13
|HW5||assigned 03/13||due 03/20
|HW6||assigned 03/20||due 04/03
|HW7||assigned 04/03||due 04/10
|HW8||assigned 04/10||due 04/17
|Test 2||in class 04/24
|HW9||assigned 04/24||due 05/01
|HW10||assigned 05/01||due 05/08
||May 15, 3:30pm - 5:30pm, SS206.
Last modified: 25 Feb 2003 11:16:33 EST
to Spring 2003 CMSC 651 Homepage