See elsewhere for some discussion of what will happen during the lectures.
The following plan is preliminary, and might be updated during the course. Slides marked with an asterisk (*) are from last year’s course, and are likely to be changed in some way.
| Week | Lecture | Topics | Slides |
|---|---|---|---|
| 1 | 1 | Introduction. | 1-2 |
| 2 | Repetition: Logic, sets, relations and functions. | ||
| 3 | Proofs. Induction for the natural numbers. Inductively defined sets. Recursive functions. | 3 | |
| 2 | 4 | Structural induction. Some concepts from automata theory. | 4 |
| 5 | Deterministic finite automata. | 5 | |
| 6 | Nondeterministic finite automata. The subset construction. | 6 | |
| 3 | 7 | Nondeterministic finite automata with ε-transitions. Exponential blowup. | 7 |
| 8 | Regular expressions. Translation from finite automata to regular expressions. | 8 | |
| 4 | 9 | Translation from regular expressions to finite automata. Regular languages. | 9 |
| 5 | 10 | Some algorithms for regular languages. | 10 |
| 11 | Context-free grammars. | 11 | |
| 6 | 12 | Context-free grammars. | 12 |
| 13 | Context-free languages. | 13 | |
| 7 | 14 | Context-free languages. | 14 |
| 15 | Pushdown automata. Turing machines. | 15 | |
| 8 | 16 | Summary. | 16 |
| 17 | Old exams. |
Answers to quizzes.