SI340 Fall 2013
August 2013
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

Week 1 
19

Class 1
Introduction, sets, and functions
(Ch 0.1-0.2)
20 21

Class 2
Relations and graphs
(Ch 0.2)
22 23

Class 3
Strings, languages, Boolean logic, definitions and theorems
(Ch 0.2-0.3)
24
25

Week 2 
26

Class 4
Types of proofs
(Ch 0.4)
Quiz 1 HW 1
27 28

Class 5
Types of proofs
(Ch 0.4)
29 30

Class 6
Finite automata I
(Ch 1.1)
31

September 2013
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
1

Week 3 
2

Labor Day
3

Class 7
Finite automata II
(Ch 1.1)
Quiz 2, HW1 due

Monday Schedule
4

Class 8
Regular operations
(Ch 1.1)
HW 2
5 6

Class 9
NFA
(Ch 1.2)
7
8

Week 4 
9

Class 10
Review
10 11

Class 11
Review
HW2 due
12 13

Class 12
Equivalence of NFAs and DFAs I
(Ch 1.2)
14
15

Week 5 
16

Class 13
Equivalence of NFAs and DFAs II
(Ch 1.2)
17 18

Class 14
Closure under regular operations
(Ch 1.2)
Quiz 3 HW 3
19 20

Class 15
Regular expressions (RE)
(Ch 1.3)
21
22

Week 6 
23

Class 16
Equivalence of RE and FA I
(Ch 1.3)
24 25

Class 17
Equivalence of RE and FA II
(Ch 1.3)
26 27

Class 18
6Wk Exam
28
29

Week 7 
30

Class 19
Pumping Lemma I
(Ch 1.4)
         

October 2013
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
    1 2

Class 20
Review
HW 4
3 4

Class 21
Review
5
6

Week 8 
7

Class 22
Pumping Lemma II
(Ch 1.4)
8 9

Class 23
Pumping Lemma III
(Ch 1.4)
Quiz 4
10 11

Class 24
Pumping Lemma IV
(Ch 1.4)
HW 5
12
13

Week 9 
14

Columbus Day
15 16

Class 25
Context-free grammars I
(Ch 2.1)
17 18

Class 26
Context-free grammars II
(Ch 2.1)
19
20

Week 10 
21

Class 27
Context-free grammars III
(Ch 2.1)
Quiz 5 HW 6
22 23

Class 28
Ambiguity, Chomsky Normal Form
(Ch 2.1)
24 25

Class 29
Pushdown automata I (PDA)
(Ch 2.2)
26
27

Week 11 
28

Class 30
Pushdown automata II (PDA)
(Ch 2.2)
29 30

Class 31
12Wk Exam
31    

November 2013
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
          1

Class 32
Pumping lemma for CFGs I
(Ch 2.3)
2
3

Week 12 
4

Class 33
Pumping lemma for CFGs II
(Ch 2.3)
HW 7
5 6

Class 34
Turing machines
(Ch 3.1)
Quiz 6
7 8

Class 35
Turing machines II
(Ch 3.1)
9
10

Week 13 
11

Veterans' Day
12 13

Class 36
Variants of TMs I
(Ch 3.2)
14 15

Class 37
Variants of TMs II
(Ch 3.2)
16
17

Week 14 
18

Class 38
Church-Turing Thesis
(Ch 3.3)
HW 8
19 20

Class 39
Decidable languages
(Ch 4.1)
Quiz 7
21 22

Class 40
Diagonolization, undecidable languages I
(Ch 4.2)
23
24

Week 15 
25

Class 41
Diagonolization, undecidable languages II
(Ch 4.2)
26 27

Class 42
Undecidable problems from language theory I
(Ch 5.1)
HW 9
28

Thanksgiving
29

Thanksgiving
30

December 2013
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
1

Week 16 
2

Class 43
Mapping reductions
(Ch 5.3)
3 4

Class 44
Review
Quiz 8
5

Last Day of Class
6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31