UMBC CMSC651, Automata Theory & Formal Languages, Spring 2000

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

Review 1 assigned 02/24 due 03/02

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

HW4 assigned 03/07 due 03/14

HW5 assigned 03/14 due 03/28

HW6 assigned 03/28 due 04/04

Review 2 assigned 04/06 due 04/13

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

HW7 assigned 04/18 due 04/25

HW8 assigned 04/25 due 05/02

HW9 assigned 05/02 due 05/09

Review 3 assigned 05/11 due 05/18

Last Modified: 28 Jan 2000 19:42:35 EST by Richard Chang, chang@umbc.edu

HW1	assigned 02/01	due 02/08
HW2	assigned 02/08	due 02/15
HW3	assigned 02/15	due 02/22
Review 1	assigned 02/24	due 03/02

HW4	assigned 03/07	due 03/14
HW5	assigned 03/14	due 03/28
HW6	assigned 03/28	due 04/04
Review 2	assigned 04/06	due 04/13

HW7	assigned 04/18	due 04/25
HW8	assigned 04/25	due 05/02
HW9	assigned 05/02	due 05/09
Review 3	assigned 05/11	due 05/18