David's Office Hours: MTWR 11:15a-12:15p, 420 Rhodes, or by appointment.
Reba's Office Hours: M 1:30-3:30p, WR 1:30p-2:30p, F 11:15a-12:15p, 5136
Upson.
Handouts
Handouts should be available here. Let
us know if you experience any problems.
Coverage Information
2 July 2003: FINAL.
1 July 2003: Undecidable Problems about CFLs. (Lecture 35.)
30 June 2003: Recap of reduction, enumeration machines, and
undecidability. (Lectures 29 through 33, again.)
27 June 2003: [Reba] Rice's Theorem. (Lecture 34.)
26 June 2003: Undecidability and Reduction. (Lectures 32 and
33.)
25 June 2003: Church/Turing Thesis, and Undecidability of the
Halting Problem. (Lecture 31.)
24 June 2003: More Turing Machines, and Other Models.
(Lectures 29 and 30.)
23 June 2003: Intro to Turing Machines. (Lectures 28 and 29.)
20 June 2003: PRELIM #2.
19 June 2003: Parsing. (Lecture 26.)
18 June 2003: CKY Algorithm. (Lecture 27.)
17 June 2003: Pushdown Automata and Context-Free Languages.
(Lectures 24 and 25, and a hint of Lecture E.)
16 June 2003: Pushdown Automata. (Lecture 23.)
13 June 2003: Pumping Lemma for CFLs. (Lecture 22.)
12 June 2003: Normal Forms. (Lecture 21.)
11 June 2003: Balanced Parentheses. (Lecture 20.)
10 June 2003: Intro to CFGs/CFLs. (Lecture 19, and CS 280.)
9 June 2003: State Minimization concluded; Regular Language
Miscellanea. (end
of Lecture 14, and a whirlwind tour of Lectures 10 and 15-18.)
6 June 2003: State Minimization. (Lectures 13 and 14.)
5 June 2003: PRELIM #1.
4 June 2003: More on the Pumping Lemma; Intro to State Minimization.
(end of Lecture 12, and Lecture 13.)
3 June 2003: Pumping Lemma. (end of Lecture 11, and Lecture 12.)
2 June 2003: Converting NFAs to Regular Expressions; Limitations of
Regular Languages. (end of Lecture 9, and Lecture 11.)
30 May 2003: Pattern Matching, Regular Expressions, and Regular
Languages. (Lectures 8 and 9.)
29 May 2003: Epsilon-Transitions; Intro to Pattern Matching. (end of
Lecture 6, and Lecture 7.)
28 May 2003: Subset Construction. (Lecture 6.)
27 May 2003: Intro to NFAs. (Lectures 5 and 6.)
26 May 2003: NO LECTURE: Memorial Day.
23 May 2003: Closure Properties for Regular Languages. (Lecture 4.)
22 May 2003: Intro to DFAs. (Lectures 2 and 3.)
21 May 2003: Course Introduction. (Lecture 1, and Lecture 31
for some of the details.)
Announcements
Everything is now graded, and you can contact Reba to reclaim your
graded course materials.
If you have not yet submitted your course evaluation forms to the Coop
Office, please do so! Also, please feel free to email David with any
additional comments about the course
(organization/execution/style/etc.).
Thanks for a great semester!
Handouts should be available here.
Let us know if you experience any problems.