| LN |
Day |
Date |
Chapter |
Topic |
| 1 |
M |
28-Aug |
|
Introduction |
| 2 |
W |
30-Aug |
1,2 |
Languages and decision problems |
| 3 |
F |
01-Sep |
3 |
Regular
expressions |
|
M |
04-Sep |
|
NO CLASS: LABOR DAY |
| 4 |
W |
06-Sep |
3.1-3.3 |
DFAs |
| 5 |
F |
08-Sep |
3.4-3.5 |
Transitions
and derivations |
| 6 |
M |
11-Sep |
3.5 |
Closures;
cross products of machines |
| 7 |
W |
13-Sep |
4.1 |
NFAs |
| 8 |
F |
15-Sep |
4.2 |
Lambda
NFAs |
| 9 |
M |
18-Sep |
4.2 |
L(NFA)=L(lambda
NFA): converting lambda NFAs to NFAs |
| 10 |
W |
20-Sep |
4.2 |
L(DFA)=L(NFA):
converting NFAs to DFAs |
| 11 |
F |
22-Sep |
4.3 |
Special guest lecture by a younger James Foster (see notes) |
| 12 |
M |
25-Sep |
4.3 |
L(REG)
is in L(DFA): Converting Reg. Exp.s to DFAs |
| 13 |
W |
27-Sep |
4.3 |
L(DFA)
is in L(REG): converting DFAs to Reg. Exp.s |
|
F |
29-Sep |
|
no Class: instructor was ill |
| 14 |
M |
02-Oct |
5.1, 5.2 |
Minimizing
DFAs, Uniqueness |
| 15 |
W |
04-Oct |
5.3 |
Myhill
Nerode Theorem |
| 16 |
F |
06-Oct |
5.3 |
Pumping lemma |
| 17 |
M |
09-Oct |
5.4-5.5 |
Are we done? (and review) |
| 18 |
W |
11-Oct |
|
TEST 1 |
| 19 |
F |
13-Oct |
6.1-6.2 |
Context
free languages |
|
M |
16-Oct |
|
no Class: instructor was ill |
| 20 |
W |
18-Oct |
6.3, 11.3 |
L(REG)
is in L(CFL) properly |
| 21 |
F |
20-Oct |
7.1-7.3 |
Pushdown
automata |
| 22 |
M |
23-Oct |
7.1-7.3 |
more on automata |
| 23 |
W |
25-Oct |
7.4 |
L(CFL)
is in L(PDA) |
| 24 |
F |
27-Oct |
7.5 |
L(PDA) is in L(CFL),
they're equal! |
| 25 |
M |
30-Oct |
8.1 |
Pumping lemma for CFGs,
closures |
| 26 |
W |
01-Nov |
9.1-9.2 |
Turing
machines |
| 27 |
F |
03-Nov |
9.3 |
Combining
TMs |
| 28 |
M |
06-Nov |
9.4 |
TM transducers |
| 29 |
W |
08-Nov |
9.5 |
L(DTM)
= L(2 way inf DTMs), L(DTM) = L(k-DTM) |
| 30 |
F |
10-Nov |
9.6 |
L(DTM)
= L(NTM) |
| 31 |
M |
13-Nov |
9.7 |
Universal
TMs |
| 32 |
W |
15-Nov |
|
TEST 2 |
| 33 |
F |
18-Nov |
|
No Class: Students
revolted |
|
M |
20-Nov |
|
NO CLASS: THANKSGIVING |
|
W |
22-Nov |
|
NO CLASS: THANKSGIVING |
|
F |
25-Nov |
|
NO CLASS: THANKSGIVING |
| 34 |
M |
27-Nov |
|
L(DTM)=L(NTM) |
| 36 |
W |
29-Nov |
|
Universal
TMs |
| 37 |
F |
02-Dec |
10.1-10.2 |
Recursive
and r.e. languages |
| 38 |
M |
04-Dec |
10.3 |
L(rec)
in L(r.e.) in L(all), Closures |
| 39 |
W |
06-Dec |
10.4 |
Unsolvable
decision problems |
| 40 |
F |
09-Dec |
12.1-12.3 |
The Halting problem,
reductions |
| 41 |
M |
11-Dec |
14.1-14.2 |
Computational complexity
basics |
| 42 |
W |
13-Dec |
14.3, 15.1 |
complexity classes |
| 43 |
F |
15-Dec |
15.2 |
NP
completeness |
|
M |
18-Dec |
|
TEST 3: 10:00-11:00 (not cumulative)
|