TU Dresden | Wintersemester 2020 / 2021 Automata and Logic

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.

Prerequisites: Undergraduate course on automata and formal languages. Basic notions from logic would also be helpful.

Display more information
Access to this course has been restricted. Please login. Login
Information about access
You do not have enough rights to start this resource.