Aug 18th - The information on this page is preliminary.
Responsible for the module is Prof. Dr. Roland Meyer. The lecture is held by Eren Keskin. The exercise is held by René Maseli.
On two times per week, the lecture leads through the topics of this course. Each two weeks, the monday lecture is replaced by an exercise that prepares the students for the homeworks and the exam.
Lecture / Exercise (weekly): [Stud.IP], [Schedule]
Tutorials (biweekly): [Stud.IP]
"Lerntreff Theorie" (weekly):
To finish this course, you need to fulfill two requirements:
The written exam will take place on friday, March 05th 2027, from 11:00 AM to 1:00 PM, in the Audimax and UP 3.007.
| Date | Topic |
|---|---|
| Oct 19 | Exercise 0a: Introduction to proofs |
| Oct 20 | Exercise 0b: Induction |
| Oct 26 | Lattices, Fixed points |
| Oct 27 | Theorem of Knaster & Tarski |
| Nov 2 | Exercise 1 |
| Nov 3 | Continuity, Theorem of Kleene |
| Nov 9 | While programs |
| Nov 10 | Dataflow analyses |
| Nov 16 | Exercise 2 |
| Nov 17 | Regular languages |
| Nov 23 | Finite automata and Arden's Lemma |
| Nov 24 | Completeness of regular languages |
| Nov 30 | Exercise 3 |
| Dec 1 | Theorem of Myhill & Nerode |
| Dec 7 | Minimal DFAs |
| Dec 8 | Pumping-Lemma for regular languages |
| Dec 14 | Exercise 4 |
| Dec 15 | History of Computer Science |
| Jan 4 | Formal grammars and contextfree languages |
| Jan 5 | Chomsky normal form and Greibach normal form |
| Jan 11 | Exercise 5 |
| Jan 12 | Pumping-Lemma for contextfree languages |
| Jan 18 | CYK-Algorithm |
| Jan 19 | Pushdown automata |
| Jan 26 | Exercise 6 |
| Jan 27 | Characterisation of contextfree languages |
| Feb 1 | Completeness of contextfree languages |
| Feb 2 | Exam preparations |