COMP 330 Winter 2021: Lecture Schedule
Prakash Panangaden
Lecture 0
5 January
Lecture 1
7 January
Introduction, basic maths
Lecture 1
12 January
Deterministic finite automata
Lecture 2
14 January
Nondeterministic finite automata
Quiz 1
15-16 January
Basic logic
Lecture 1
19 January
Regular expressions
Lecture 2
21 January
Kleene¡¯s theorem
Lecture 1
26 January
The pumping lemma
Lecture 2
28 January
The pumping lemma
Quiz 2
29-30 January
DFA, NFA, regular expressions
Lecture 1
2 February
Minimization
Lecture 2
4 February
The Myhill-Nerode theorem
Lecture 1
9 February
Review
Lecture 2
11 February
MIDTERM
Lecture 1
16 February
Context-free languages
Lecture 2
18 February
Designing context-free languages
Lecture 1
23 February
Pushdown automata
Lecture 2
25 February
Designing pushdown automata
Quiz 3
26-27 February
Context-free languages
Lecture 1
9 March
The pumping lemma for CFLs
Lecture 2
11 March
Introduction to computability
Lecture 1
16 March
Models of computation
Lecture 2
18 March
Basic computability
Quiz 4
19-20 March
Context-free pumping lemma
Lecture 1
23 March
Reductions
Lecture 2
25 March
Reductions
Lecture 1
30 March
Undecidable problems about CFG
Lecture 2
1 April
The Post correspondence problem
Lecture 1
6 April
Undecidability of FOL
Lecture 2
8 April
The recursion theorem
Quiz 5
9-10 April
Reductions
Lecture 1
13 April
Review for the final
Week 1 Week 2
Week 3 Week 4
Week 5 Week 6 Week 7 Week 8
Week 9 Week 10
Week 11 Week 12 Week 13
Week 14
A1 out
A1 due, A2 out
A2 due, A3 out
A3 due, A4 out
A4 due, A5 out
A5 due, A6 out
A6 due
1