August 2005
SundayMondayTuesdayWednesdayThursdayFridaySaturday
  1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22

Class 1: Intro: course, alphabet, language.
23 24

Class 2: Introducing finite automata and JFLAP.
25 26

Class 3: Complement, instersect machines with diagrams
27
28 29

Class 4: Set Theory Basics
30 31

Class 5: A formal definition of a DFA
     

September 2005
SundayMondayTuesdayWednesdayThursdayFridaySaturday
        1 2

Class 6: Functions and Formal Algorithms
(Quiz 1 Due 9/6)
3
4 5

Labor Day
6

Class 7: More formal algorithms

Monday Schedule
7

Class 8: More formal algorithms
8 9

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

Class 10: Finishing configurations and started NDFAs
13 14

Class 11: Constructing NDFAs & formal definition of NDFAs
15 16

Class 12: More algorithms for NDFAs
(Quiz 2 Due 9/19)
17
18 19

Class 13: Reviewing Algorithms & Notation
20 21

Class 14: Reprising Proof & Algorithm
22 23

Class 15: Converting NDFAs to DFAs
24
25 26

Class 16: Converting NDFAs to DFAs II
27 28

*6Wk Exam
29 30

Class 17: Converting NDFAs to DFAs III
 

October 2005
SundayMondayTuesdayWednesdayThursdayFridaySaturday
            1
2 3

Class 18: Intro to Regular Expressions
4

6Wk Grades Due
5

Class 19: Lab: Regular expressions in Perl
6 7

Class 20: Equivalence of REs and FAs
8
9 10

Columbus Day
11 12

Class 21: Pumping Lemma I
13 14

Class 22: Pumping Lemma II
15
16 17

Class 23: Pumping Lemma Reprise
18 19

Class 24: State Minimization
20 21

Class 25: Be a scientist: Add output!
(Quiz 3 Due 10/24)
22
23 24

Class 26: Finish Transducer Experiment
25 26

Class 27: Introduction to Context Free Grammars
27 28

Class 28: Parse Trees & Ambiguity
29
30 31

Class 29: Algorithms for CFGs
         

November 2005
SundayMondayTuesdayWednesdayThursdayFridaySaturday
    1 2

*12Wk Exam
3 4

Class 30: Pushdown Automata
5
6 7

Class 31: Converting Grammars to PDAs
8

12Wk Grades Due
9

Class 32: Parsing Lab
10 11

Veterans' Day
12
13 14

Class 33: More on Parsing
15 16

Class 34: A Pumping Lemma for CFGs
17 18

Class 35: More on what's not a CFL
(Quiz 5 Due 11/21)
19
20 21

Class 36: Introduction to Turing Machines
22 23

Class 37: A formal definition of a Turing Machine
24

Thanksgiving
25

Digestion Day
26
27 28

Class 38: Configurations and completing our formal definition
29 30

President's Address
     

December 2005
SundayMondayTuesdayWednesdayThursdayFridaySaturday
        1 2

Class 39: Equivalence of different TMs, Part I
(Quiz 7 Due 12/7)
3
4 5

Class 40: Equivalence of different TMs Part II
6 7

Class 41: Universal TMs and the Chuch-Turing Thesis

Friday Schedule
8 9

Class 42: The Halting Problem

Study Afternoon

Wednesday Schedule
10

First Final
11

REVIEW
2000-2200, MI223
12

SI472 Final (0755-1055, MI223)
13 14 15 16 17

Last Final
18 19 20 21

Final Grades Due
22 23 24
25 26 27 28 29 30 31