August 2004

SunMonTueWedThuFriSat
1 2
3 4
5 6
7
8 9
10 11
12 13
14
15 16
17 18
19 20
21
22 23
Class 1 Intro: course, alphabet, language.
24 25
Class 2 Introducing finite automata and JFLAP.
26 27
Class 3 Comp, instersect machines with diagrams
28
29 30
Class 4 Set Theory Basics
31
Calendar

September 2004

SunMonTueWedThuFriSat
1
Class 5 A formal definition of a DFA
2 3
Class 6 Functions and Formal Algorithms
4
5 6
Labor Day
7
Thursday Schedule
8
Class 7 More formal algorithms
9 10
Class 8 More formal algorithms
11
12 13
Class 9 Configurations and a formal def of accept/reject
14 15
Class 10 Finishing configurations and started NDFAs
16 17
Guest Lecture Comp. Time
18
19 20
Class 11 Constructing NDFAs & and a formal definition of NDFAs
21 22
Class 12 More algorithms for NDFAs
23 24
Class 13 Parents & Class 12 continuation
25
26 27
Class 14 Reprising Proof & Algorithm
28 29
6-Week Exam
30
  
Calendar

October 2004

SunMonTueWedThuFriSat
1
No Class
2
3 4
Class 15 Converting NDFAs to DFAs
5 6
Class 16 Converting NDFAs to DFAs II
7
6Wk Grades Due
8
Class 17 Converting NDFAs to DFAs III
9
10 11
Class 18 Intro to Regular Expressions
12 13
Class 19 Lab: Regular expressions in Perl
14 15
Class 20 Equivalence of REs and FAs
16
17 18
Class 21 Pumping Lemma I
19 20
Class 22 Pumping Lemma II
21 22
Class 23 Pumping Lemma Reprise
23
24 25
Class 24 State Minimization
26 27
Class 25 Introduction to Context Free Grammars
28 29
Class 26 Parse Trees & Ambiguity
30
31
Calendar

November 2004

SunMonTueWedThuFriSat
1
Class 27 Algorithms for CFGs
2 3
Review for Exam
4 5
12WkExam (in class)
6
7 8
Exam Debrief
9
12Wk Grades Due
10
Class 28 Pushdown Automata
11
Veteran's Day
12
Class 29 Converting Grammars to PDAs
13
14 15
Class 30 Parsing Lab
16 17
Class 31 A Pumping Lemma for CFGs
18 19
Class 32 More on what's not a CFL
20
21 22
Class 33 Introduction to Turing Machines
23 24
Class 34 A formal definition of a Turing Machine
25
Thanksgiving
26
No Class
27
28 29
Class 35 Configurations and completing our formal definition
30
  
Calendar

December 2004

SunMonTueWedThuFriSat
1
Class 36 Equivalence of different TMs, Part I
2 3
Class 37 Equivalence of different TMs Part II
4
5 6
Class 38 Universal TMs and the Chuch-Turing Thesis
7 8
Class 39
The Halting Problem Friday Schedule
9 10
11
12 13
14 15
16 17
18
19 20
21 22
23 24
25
26 27
28 29
30 31