Event
The dates and events shown here are dynamically displayed from Stud.IP.
Therefore, if you have any questions, please contact the person listed under the item Lehrende/DozentIn (Lecturers) directly.
Event
Semester:
Summer term
2022
2.01.488 Advanced Automata Theory -
Event date(s) | room
- Mittwoch, 20.4.2022 10:15 - 11:45 | A05 1-160
- Mittwoch, 20.4.2022 14:15 - 15:45
- Mittwoch, 27.4.2022 10:15 - 11:45 | A05 1-160
- Mittwoch, 27.4.2022 14:15 - 15:45
- Mittwoch, 4.5.2022 10:15 - 11:45 | A05 1-160
- Mittwoch, 4.5.2022 14:15 - 15:45
- Mittwoch, 11.5.2022 10:15 - 11:45 | A05 1-160
- Mittwoch, 11.5.2022 14:15 - 15:45
- Mittwoch, 18.5.2022 10:15 - 11:45 | A05 1-160
- Mittwoch, 18.5.2022 14:15 - 15:45 | A02 2-239
- Mittwoch, 25.5.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 25.5.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 1.6.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 1.6.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 8.6.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 8.6.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 15.6.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 15.6.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 22.6.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 22.6.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 29.6.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 29.6.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 6.7.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 6.7.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 13.7.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 13.7.2022 14:15 - 15:45 | A03 2-209
- Mittwoch, 20.7.2022 10:15 - 11:45 | A03 2-209
- Mittwoch, 20.7.2022 14:15 - 15:45 | A03 2-209
Description
In this course, we study advanced topics of automata on finite words and introduce automata on infinite words. Moreover, we investigate the relationship of automata to logic and computer-aided verification. We will also study how automata can be used to provide formal guarantees for (recurrent) neural networks. In particular, we will consider the following topics:
* Automata over finite trees
* Learning of finite automata
* Various types of automata over infinite words (e.g., Büchi, Parity, Muller, and Rabin), their properties, and their relationship to each other
* Connection of automata and logic, specifically Linear Temporal Logic, first-order logic, and monadic second-order logic
If time permits, we will also study infinite games as a mechanism for the automated synthesis of reactive systems.
* Automata over finite trees
* Learning of finite automata
* Various types of automata over infinite words (e.g., Büchi, Parity, Muller, and Rabin), their properties, and their relationship to each other
* Connection of automata and logic, specifically Linear Temporal Logic, first-order logic, and monadic second-order logic
If time permits, we will also study infinite games as a mechanism for the automated synthesis of reactive systems.
lecturer
SWS
--