[TU Dresden]

Automata and Logic

Technische Universität Dresden
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie

Prof. Dr.-Ing. Franz Baader

Course Description

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.

Organization

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

Exercise Group

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:

Credits / Examinations

Computational logic students can earn 9 credits by attending this lecture. In order to get the credits, CL students have to do meet both of the following two obligations:
  1. present at least three exercises in front of the exercise group;

  2. pass an oral examination at the end of the term performed by Prof. Baader.
Computer Science students are not obliged to present exercises, but are invited to do so.

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.

Script

A complete script is available, both in german and english language.

Literature

Carsten Lutz