Week
|
|
Tuesday
|
Thursday
|
1
|
June
|
17
Central Concepts of Automata Theory
(sec 1.5) |
19
9am: Mass of the Holy Spirit
CE 160 holiday |
2
|
June
|
24
Deterministic Finite Automata
(sec 2.1, 2.2) |
26
Deterministic Finite Automata
(sec 2.2) |
3
|
July
|
1
Regular Expressions
(sec 3.1) |
3
Context-Free Grammars
(sec 5.1) |
4
|
July
|
8
Pushdown Automata
(sec 6.1) |
10
Pushdown Automata
(sec 6.1) |
5
|
July
|
15
Turing Machines
(sec 8.1, 8.2) |
17
Turing Machines
(sec 8.2) |
6
|
July
|
22
1st exam
|
24
discussion: possible projects, project requirements,
expectations, etc |
7
|
July
|
29
9am: Mass in honor of St.Ignatius
CE 160 holiday |
31
St. Ignatius Day
CE 160 holiday |
8
|
Aug
|
5
finalization of project proposals |
7
approved final project proposals due
Nondeterministic Finite Automata
(sec 2.3) |
9
|
Aug
|
12
(buffer) |
14
Finite Automata With Epsilon Transitions
(sec 2.5) |
10
|
Aug
|
19
Quezon City Day
CE 160 holiday |
21
Finite Automata and Regular Expressions
(sec 3.2) |
11
|
Aug
|
26
presentation of project proposals and project
progress
Progress Report 1 due |
28
Equivalence and Minimization of Automata
(sec 4.4) |
12
|
Sept
|
2
presentation of project proposals and project
progress
Progress Report 2 due |
4
2nd exam |
13
|
Sept
|
9
Parse Trees
(sec 5.2) |
11
presentation of project proposals and project
progress
Progress Report 3 due |
14
|
Sept
|
16
Ambiguity in Grammars and Languages
(sec 5.4) |
18
presentation of project proposals and project
progress
Progress Report 4 due |
15
|
Sept
|
23
The Languages of a PDA
(sec 6.2) |
25
presentation of project proposals and project
progress
Progress Report 5 due |
16
|
Sept
|
30
Equivalence of PDAs and CFGs
(sec 6.3) |
|
16
|
Oct
|
|
2
presentation of project proposals and project
progress |
17
|
Oct
|
7
3rd exam |
9
(buffer) |
18
|
Oct
|
13
to 17 F I N A L S W E
E K
complete project documentation due, project defense
|
