Automata and Logic
From International Center for Computational Logic
Automata and Logic
Course with SWS 4/2/0 (lecture/exercise/practical) in WS 2020
Lecturer
Tutor
SWS
- 4/2/0
Modules
Examination method
- Oral exam
This course considers finite automata that work on finite or infinite words and trees. The course concentrates on the connection between these automata and logics that play an important role in computer science, such as 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.
More information can be found here.
