UMBC CMSC 651, Automata Theory & Formal Languages,
Spring 2005, 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 02/01 |
due 02/08 |
| HW2 |
assigned 02/08 |
due 02/15 |
| HW3 |
assigned 02/15 |
due 02/22 |
| Test 1 |
in class 02/24 |
II. Turing Machines and Computability: 5 weeks, Chapters 3-6.
| HW4 |
assigned 03/01 |
due 03/08 |
| HW5 |
assigned 03/08 |
due 03/15 |
| HW6 |
assigned 03/29 |
due 04/05 |
| Test 2 |
in class 04/12 |
III. Complexity Theory: 5 weeks, Chapters 7-10.
| HW7 |
assigned 04/12 |
due 04/19 |
| HW8 |
assigned 04/19 |
due 04/26 |
| HW9 |
assigned 04/26 |
due 05/03 |
| Test 3 |
in class 05/10 |
| HW10 |
assigned 05/10 |
due 05/17 |
Final Exam: Friday May 20, 10:30am - 12:30pm, ITE
346.
Last modified: 22 Jul 2024 11:31:02 EDT
by
Richard Chang,
chang@umbc.edu
to Spring 2005 CMSC 651 Homepage