Week Day Date Topics Chapters in Cohen
1 F 1/4 Background, Languages 1,2
2 M 7 Recursion, Regular expressions 3,4
W 9 Finite Automata 5
F 11 Transition Graphs 6
3 M 14 Kleene's Theorem 7
W 16 Nondeterminism, Regular Languages 7,9
F 18 Non-regular Languages 10
4 M 21 Decidability 11
W 23 Mealy and Moore Machines 8
F 25 Review
5 M 28 Midterm #1
W 30 Context-free Grammars 12
F 2/1 Chomsky Normal Form 13
6 M 4 Midterm Break
W 6 Pushdown Automata 14
F 8 CFG = PDA 15
7 M 11 Context-free Languages 16
W 13 non CFLs 17
F 15 Decidability 18
8 M 18 Review
W 20 Midterm #2
F 22 Turing Machines 19
9 M 25 Post Machines 20
W 27 Minsky's Th. 21
F 3/1 Turing's World
10 M 4 Variations on TMs 22
W 6 TM languages 23
F 8 Chomsky Hierarchy, Computers 24,25
11 M 11 Projects due, Review
Th 14 Final Exam Slot 12:00-2:00
Opportunity Percentage
Midterm #1 20-25%
Midterm #2 20-25%
Final 30-35%
Homework & Projects 20-25%
Total 100%
(Percentages will be selected so as to maximize your individual weighted total.)
(Attendance: More than two unexcused absences will adversely affect the grade.)
Text: Introduction to Computer Theory, 2nd Ed., by D.I.A. Cohen