Bridging Course Foundations of Informatics
Winter 2026/27
- Lecturer
- Thomas Noll
Schedule
| Type | Day | Time | Room | Start | Lecturer |
|---|---|---|---|---|---|
| Kick-off | monday | Online | Thomas Noll | ||
| Questions and exercises | tuesday | Online | Thomas Noll | ||
| wednesday | Online | Thomas Noll | |||
| thursday | Online | Thomas Noll |
Formal Languages and Processes
The MOVES part of the bridging course takes place online from 22 to 25 March 2027. It combines meetings for questions and exercises with self-paced study using videos.
Contents
- Regular languages, deterministic and nondeterministic finite automata, and regular expressions
- Automata constructions, closure properties, decision problems and minimisation
- Context-free grammars, Chomsky normal form and pushdown automata
- Algorithms for membership and emptiness of context-free languages
Literature
- J. E. Hopcroft, R. Motwani and J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, 2nd edition, Addison-Wesley, 2001.
- A. Asteroth and C. Baier: Theoretische Informatik, Pearson Studium, 2002.