CSCI (Math) 361 Theory of Computation Lecture Schedule Fall 2004

During the course of the term we will be covering most of Chapters 1 through 5. The order of the topics is listed below. There are times when we will find it useful to extend a topic a bit, requiring a change in the schedule. Thus this schedule is likely to be only an approximation to the actual schedule. I will update the schedule during the term to reflect our actual progress.

Please also keep in mind that one of the first three Fridays in October will be Mountain Day. This might require minor changes to the syllabus.

Date	Topic	Reading	Homework
Sept. 10	Overview		1 out
Sept. 13	Math preliminaries	1.1-1.3	2 out
Sept. 15	Proof techniques	1.4-1.5	3 out, 1 due
Sept. 17	Closures, Alphabets	1.6	4 out, 2 due
Sept. 20	Languages, Regular Expressions	1.7-1.8	5 out, 3 due
Sept. 22	Deterministic Finite Automata	2.1	6 out, 4 due
Sept. 24	Nondeterministic Finite Automata	2.2	7 out, 5 due
Sept. 27	Equivalence of DFAs and NFAs		8 out, 6 due
Sept. 29	Languages Accepted by Finite Automata	2.3	9 out, 7 due
Oct. 1	Mountain Day
Oct. 4	Finite Automata and Regular Expressions		10 out, 8 due
Oct. 6	Pumping Lemma, How to use the Pumping Lemma	2.4	11 out, 9 due
Oct. 8	Pumping Lemma		12 out, 10 due
Oct. 11	Reading Period
Oct. 13	Minimization and Simplification	2.5	13 out, 11 due
Oct. 15	Context-Free Grammars	3.1	14 out, 12 due
Oct. 18	Exam I
Oct. 20	Relation between CFGs and Reg Expressions	3.1	15 out, 13 due
Oct. 22	Parse Trees	3.2	16 out, 14 due
Oct. 25	Pushdown Automata	3.3	17 out, 15 due
Oct. 27	PDAs and CFGs	3.4	18 out, 16 due
Oct. 29	Properties of CFGs	3.5	19 out, 17 due
Nov. 1	More Properties of CFGs		20 out, 18 due
Nov. 3	More Properties of CFGs		21 out, 19 due
Nov. 5-8	Determinism and Parsing	3.7	22 out, 20 due
Nov. 10	Turing Machines	4.1	24 out, 22 due
Nov. 12	More on Turing Machines Addendum		25 out, 23 due
Nov. 15	Computing with Turing Machines (Exam II)	4.2	26 out, 24 due
Nov. 17	Extensions of Turing Machines (Exam II)	4.3	27 out, 25 due
Nov. 19	Nondeterministic Turing Machines	4.5	28 out, 26 due
Nov. 22	Random Access Turing Machines	4.4	29 out, 27 due
Nov. 24	Thanksgiving Recess
Nov. 26	Thanksgiving Recess
Nov. 29	Universal Turing Machines		30 out, 28 due
Dec. 1	Church's Thesis and the Halting Problem	5.1, 5.3	31 out, 29 due
Dec. 3	Undecidable Problems	5.4, 5.5	32 out, 30 due
Dec. 6	Undecidable Problems		33 out, 31 due
Dec. 8	Universal Turing Machines		32 due
Dec. 10	Optional Topic: Unrestricted Grammars	4.6	33 due