Applied Automata Theory
» This course is given in English.
» There is an L2P learning room for this course.
Lecture in Summer Term 2012
|V3||Mon 14:15–15:45, AH II
Wed 08:15–09:45, AH V
|Ü2||Wed 13:30–15:00, AH IV||04.04.2011||Thomas, Chaturvedi, Lang|
Dates of the lectureDue to several conferences and meetings that professor Thomas has to attend, the lecture will not be on all dates announced above.
The lectures takes place on the following dates: 11.4., 16.4., 18.4, 23.4., 25.4., 30.4., 2.5., 7.5., 9.5., 21.5., 23.5., 4.6., 6.6., 11.6., 13.6., 25.6., 27.6., 2.7., 4.7.
Accordingly, there will be no exercises on: 16.5., 30.5., 20.6.
In this lecture of theoretical computer science, we extend concepts and results of the undergraduate course on automata theory. These results can be used for information processing and system construction/analysis.
The following topics are covered in the course:
- simulation, bisimulation and efficient minimization of automata
- algorithmic learning in the context of automata theory
- weighted automata and probabilistic automata
- automata and (second order)logics
- pushdown systems
- undecidable problems in automata theory
- petri nets
A part of the content of the lecture can be found in the old script. Furthermore, we are going to publish a new script in the course of the lecture.
Knowledge of automata theory as presented in basic courses is required for participation.
Credits and usage
The course is adressed to bachelor students as well as to master students with major or minor in computer science or software systems engeneering. However, the exercises and the exam will be different depending on whether you are bachelor or master student.