August 2017
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
Class 1: Intro: course, alphabet, language.
22
23
Class 2: Introducing finite automata and JFLAP.
Bring laptop to class!
24
25
Class 3: Complement, instersect machines with diagrams
26
27
28
Class 4: Set Theory Basics
29
30
Class 5: A formal definition of a DFA
31
   

September 2017
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
         
1
Class 6: Functions and Formal Algorithms
2
3
4
Labor Day
5
Class 7: More formal algorithms
Monday Schedule
6
Class 8: More formal algorithms
7
8
Class 9: Configurations and a formal def of accept/reject
9
10
11
Class 10: Finishing configurations and started NDFAs
12
13
Class 11: Constructing NDFAs & formal definition of NDFAs
14
15
Class 12: More algorithms for NDFAs
16
17
18
Class 13: Reprising Proof & Algorithm
19
20
Class 14: Converting NDFAs to DFAs
21
22
Class 15: Converting NDFAs to DFAs II
23
24
25
Class 16: Intro to Regular Expressions
Academic Reserve
26
Academic Reserve
27
Class 17: Lab: Regular expressions in Perl
Academic Reserve
28
Academic Reserve
29
6Wk Exam
Academic Reserve
30

October 2017
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
1
2
Exam Debrief
&
RE->FA Intro
Review Union, Concatenation and Kleene Star algorithms for NDFAs (Class 12)
3
4
Class 18: Equivalence of REs and FAs
5
6
Class 19: Pumping Lemma I
7
8
9
Columbus Day
10
11
Class 20: Pumping Lemma II
12
13
Class 21: Pumping Lemma Reprise
14
15
16
Class 22: State Minimization
17
18
Viewing Project Videos
19
20
Class 23: Introduction to Context Free Grammars
21
22
23
Class 24: Parse Trees & Ambiguity
24
25
Class 25: Algorithms for CFGs
26
27
Class 26: Pushdown Automata
28
29
30
Class 27: Converting Grammars to PDAs
Academic Reserve
31
Academic Reserve
       

November 2017
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
     
1
Class 28: More on Parsing
Academic Reserve
2
Academic Reserve
3
12Wk Exam
Academic Reserve
4
5
6
Exam Debrief
7
8
Class 29: A Pumping Lemma for CFGs
9
10
Veterans' Day (observed)
11
12
13
Class 30: More on what's not a CFL
14
15
Class 31: Introduction to Turing Machines
16
17
Class 32: A formal definition of a Turing Machine
18
19
20
Class 33: Configurations and completing our formal definition
21
22
Class 34: What if we did FAs differently?
23
Thanksgiving
24
Digestion Day
25
26
27
Class 35: Equivalence of different TMs, Part I
28
29
Class 36: Equivalence of different TMs Part II
30
   

December 2017
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
         
1
Class 37: Universal TMs and the Chuch-Turing Thesis
2
3
4
Class 38: The Halting Problem
5
6
Class 39: Conclusion
7
8
Reading Day
9
10
11
Reading Day
12
First Final
13
14
SI340 Final Exam 1330
15
16
17
18
19
Last Final
20
21
Grades Due
22
23
24
25
26
27
28
29
30
31