August 2011
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


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 2011
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
       
1


2

Class 6: Functions and Formal Algorithms

3


4


5


Labor Day
6

Class 7: More formal algorithms

Add Course Deadline
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

Start Prereg
17


18


19

Class 13: Reprising Proof & Algorithm

20


21

Class 14: Converting NDFAs to DFAs

22


23

Class 15: Converting NDFAs to DFAs II

End Prereg
24


25


26

PreExam Review

Start X-week
27


28

6Wk Exam

29


30

Class 16: Intro to Regular Expressions

End X-week
 

October 2011
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
           
1


2


3

Class 17: Lab: Regular expressions in Perl

4


Grades Due
5

Exam Debrief
&
RE->FA Intro
Homework

6


7

Class 18: Equivalence of REs and FAs

8


9


10


Columbus Day
11


12

Class 19: Pumping Lemma I

13


14

Class 20: Pumping Lemma II

15


16


17

Class 21: Pumping Lemma Reprise

18


19

Class 22: State Minimization

20


21

Class 23: Introduction to Context Free Grammars

22


23


24

Class 24: Parse Trees & Ambiguity

25


26

Class 25: Algorithms for CFGs

27


28

Class 26: Pushdown Automata

29


30


31

Class 27: Converting Grammars to PDAs

Start X-week
         

November 2011
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
   
1


2

12Wk Exam

3


4

Class 28: Parsing Lab

End X-week
5


6


7

Exam Debrief

8


Grades Due
9

Class 29: More on Parsing

10


Drop course deadline
11


Veterans' Day
12


13


14

Class 30: A Pumping Lemma for CFGs

15


16

Class 31: More on what's not a CFL

17


Start Registration
18

Class 32: Introduction to Turing Machines

19


20


21

Class 33: A formal definition of a Turing Machine

22


23

Class 34: Other Applications of automata & grammars

Early Schedule
24


Thanksgiving
25


Digestion Day
26


27


28

Class 35: Configurations and completing our formal definition

29


30

Class 36: Equivalence of different TMs, Part I

     

December 2011
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
       
1


2

Class 37: Equivalence of different TMs Part II

3


4


5

Class 38: Universal TMs and the Chuch-Turing Thesis

6


7

Class 39: The Halting Problem

8


9

Class 40: Conclusion

End Registration
Last Day of Classes
10


11


12


Reading Day
13


Start Finals
14


15


16


17


18


19


20


End Finals
21


22


23


Grades Due
24


25


26


27


28


29


30


31