|DOZENT:||Prof. Dr. Thomas Zeume|
|FAKULTÄT:||Center of Computer Science|
|ANGEBOTEN IM:||jedes Sommersemester|
INFOSVorlesung Dienstags: ab 10:00 bis 12.00 Uhr
LERNZIELEStudents learn about diﬀerent automata models that are used in computer science. They learn how models can be analysed with respect to closure properties and algorithmic properties. They shall develop an understanding o the power o distinct automata models, and be enabled to develop and analyse new automata models.
INHALTAutomata play an important role in computer science and its applications. As an example, finite state automata as introduced in introductory courses on theoretical computer science, are used in compiler construction and in pattern matching for strings. In this course we systematically study the theoretical foundations of diverse automata models and establish connections of automata theory to other areas such as logic and algebra. Automata models have been developed for a plethora of applications, among other we will study w-Automata: Very similar to finite state automata, these automata work on infinite words. They are used in formal verification of hardware and software. Tree automata: Inputs for these automata are trees and they are used for instance in specification and querying of tree-shaped data, as for instance XML or JSON. Probabilistic automata: These automata accept their inputs with certain probabilities and can be used in pattern recognition and formal verification. The focus of this course is on theoretical properties of automata, but we will also consider some applications.
VORAUSSETZUNGEN CREDITSBestandene Modulabschlussprüfung
EMPFOHLENE VORKENNTNISSEThis is a course for students of mathematics, computer science and ITS. Knowledge from an introductory theoretical computer science course is mandatory.