Try Firefox!
August 2007
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
      1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20

Class 1: Intro: course, alphabet, language.
21 22

Class 2: Introducing finite automata and JFLAP.
23 24

Class 3: Complement, instersect machines with diagrams
25
26 27

Class 4: Set Theory Basics
28 29

Class 5: A formal definition of a DFA
30 31

Class 6: Functions and Formal Algorithms
(Quiz 1 assigned, due 9/4)

Add Deadline
 

September 2007
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
            1
2 3

Labor Day
4

Class 7: More formal algorithms

Monday Schedule
5

Class 8: More formal algorithms
6 7

Class 9: Configurations and a formal def of accept/reject
8
9 10

Class 10: Finishing configurations and started NDFAs
11 12

Class 11: Constructing NDFAs & formal definition of NDFAs
13 14

Class 12: More algorithms for NDFAs
(Quiz 2 assigned, due 9/19)
15
16 17

Class 13: Reprising Proof & Algorithm
18 19

Class 14: Converting NDFAs to DFAs
20 21

Class 15: Converting NDFAs to DFAs II
22
23 24

Class 16: Converting NDFAs to DFAs III

Start X-week
25

Review Session 1915
26

6Wk Exam
27 28

Class 17: Intro to Regular Expressions

End X-week
29
30            

October 2007
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
  1

Class 18: Lab: Regular expressions in Perl
2 3

Class 19: Exam Review & Equivalence of REs and FAs
4 5

Class 20: Pumping Lemma I
6
7 8

Columbus Day
9 10

Class 21: Pumping Lemma II
11 12

Class 22: Pumping Lemma Reprise
13
14 15

Class 23: State Minimization
16 17

Class 24: Introduction to Context Free Grammars
18 19

Class 25: Parse Trees & Ambiguity
(Quiz 3 assigned, due 10/22)
20
21 22

Class 26: Algorithms for CFGs
23 24

Class 27: Pushdown Automata
25 26

Class 28: Converting Grammars to PDAs
27
28 29

Class 29: A Pumping Lemma for CFGs

Start X-week
30 31

Class 30: Parsing Lab
     

November 2007
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
        1 2

12Wk Exam

End X-week
3
4 5

Notre Dame Defeat Day
6 7

Class 31: More on Parsing
8 9

Class 32: More on what's not a CFL

Drop Deadline
10
11 12

Veteran's Day (observed)
13 14

Exam Debrief
15 16

Class 33: Introduction to Turing Machines

Start Registration
17
18 19

Class 34: A formal definition of a Turing Machine
20 21

Class 35: Configurations and completing our formal definition
22

Thanksgiving
23

Digestion Day
24
25 26

Class 36: Equivalence of different TMs, Part I
27 28

Class 37: Equivalence of different TMs Part II
29 30

Class 38: Universal TMs and the Chuch-Turing Thesis

End Registration
 

December 2007
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
            1
2 3

Class 39: The Halting Problem
4 5

Class 40: Conclusion
6

Reading Day
7

Start Finals
8
9 10 11 12

Final Exam (1330,MI223)
13 14

End Finals
15
16 17 18 19 20

Grades Due
21 22
23 24 25

Christmas Day
26 27 28 29
30 31