UMBC CMSC651, Automata Theory & Formal Languages, Spring 1999

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: 4 weeks, Chapters 0-2.

HW1 assigned 02/02 due 02/09

HW2 assigned 02/09 due 02/16

HW3 assigned 02/16 due 02/23

Review 1 assigned 02/25 due 03/04

II. Turing Machines and Computability: 5 weeks, Chapters 3-6.

HW4 assigned 03/09 due 03/16

HW5 assigned 03/16 due 03/30

HW6 assigned 03/30 due 04/06

Review 2 assigned 04/08 due 04/15

III. Complexity Theory: 5 weeks, Chapters 7-10.

HW7 assigned 04/20 due 04/27

HW8 assigned 04/27 due 05/04

HW9 assigned 05/04 due 05/11

Review 3 assigned 05/13 due 05/20

Last Modified: 26 Jan 1999 14:05:09 EST by Richard Chang, chang@umbc.edu

HW1	assigned 02/02	due 02/09
HW2	assigned 02/09	due 02/16
HW3	assigned 02/16	due 02/23
Review 1	assigned 02/25	due 03/04

HW4	assigned 03/09	due 03/16
HW5	assigned 03/16	due 03/30
HW6	assigned 03/30	due 04/06
Review 2	assigned 04/08	due 04/15

HW7	assigned 04/20	due 04/27
HW8	assigned 04/27	due 05/04
HW9	assigned 05/04	due 05/11
Review 3	assigned 05/13	due 05/20