Automata and Logic
This course considers finite automata that work on finite or infinite words and trees. The course will concentrate on the connection between these automata and certain logics that play an important role in many areas of computer science (first-order logic, monadic second-order logic, and propositional dynamic logic); in particular, it will be shown how closure and decidability results for the automata can be used to obtain decidability results for these logics (which play an important role in many areas of computer science)
Prerequisites: Undergraduate course on Automata and Formal Languages; Basic notions from logic would be helpful.
The lecture takes place twice a week in room GRU 350: Tuesday 16:40-18:10 and Thursday 16:40-18:10.
NEW: Evaluation of the questionnaire available for download
The exercise group takes place on Wednesday 11:10-12:40 also in room GRU 350 and is held by Carsten Lutz.
The exercises can be downloaded in Postscript format:
The oral examinations will take place on February 21 in Room 433 (Prof. Baader's office). Appointments for a time slot can be made with Carsten Lutz, preferably after the exercise group.