Description
The course provides an introduction to formal languages and automata
theory.
Schedule
| week |
date |
slides |
exercises |
solutions |
material |
|---|
| 1 |
03.10 & 09.10 |
|
|
|
|
| 2 |
10.10 & 16.10 |
|
|
|
|
| 3 |
17.10 & 23.10 |
|
|
|
KMP |
| 4 |
24.10 & 30.10 |
|
|
|
|
| 5 |
31.10 & 06.11 |
|
|
|
|
| 6 |
07.11 & 13.11 |
|
|
|
|
| 7 |
14.11 & 20.11 |
|
|
|
|
| 8 |
21.11 & 27.11 |
|
|
|
|
| 9 |
28.11 & 04.12 |
|
|
|
|
| 10 |
05.12 & 11.12 |
|
|
|
old test |
| 11 |
12.12 & 08.01 |
|
|
|
compiler construction |
| 12 |
09.01 & 15.01 |
|
|
|
|
| 13 |
16.01 & 22.01 |
|
|
|
|
| 14 |
23.01 & 29.01 |
|
|
|
old exam |
| 15 |
30.01 (1st exam) |
|
|
|
|
| 16 |
28.02 (2nd exam) |
|
|
|
|
Literature
The course is largely based on the following book:
Slides as well as solutions to selected exercises will be made available
online.
Further Reading
Numerous other books exist that cover more or less the same material. The
following are recommended:
-
John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman,
Introduction to Automata Theory, Languages, and Computation (3rd
edition),
Addison Wesley, 2007,
ISBN 9780321462251
-
Elaine Rich,
Automata, Computability, and Complexity, Pearson Education, 2008,
ISBN 9780132288064