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.
HW1assigned 01/30due 02/06
HW2assigned 02/06due 02/13
HW3assigned 02/13due 02/20
Test 1in class 02/27

II. Turing Machines and Computability: 5 weeks, Chapters 3-6.
HW4assigned 02/27due 03/06
HW5assigned 03/06due 03/13
HW6assigned 03/13due 03/20
Test 2in class 04/03

III. Complexity Theory: 5 weeks, Chapters 7-10.
HW7assigned 04/03due 04/10
HW8assigned 04/10due 04/17
HW9assigned 04/17due 04/24
Test 3in class 05/01
HW10assigned 05/01due 05/08

Final Exam: May 15, 3:30pm - 5:30pm, SS206.

Last modified: 22 Jul 2024 11:31:05 EDT by Richard Chang, chang@umbc.edu
to Spring 2003 CMSC 651 Homepage