Automata and Formal Languages (IN2041)
Course 240962819 in WS 2013/4
General Data
| Course Type | Lecture w/ Exercise |
|---|---|
| Semester Weekly Hours | 6 SWS |
| Organisational Unit | Informatics 7 - Chair of Theoretical Computer Science (Prof. Esparza) |
| Lecturers | |
| Dates |
Assignment to Modules
-
IN2041: Automaten und formale Sprachen / Automata and Formal Languages
This module is included in the following catalogs:- Catalogue of non-physics elective courses
Further Information
Courses are together with exams the building blocks for modules. Please keep in mind that information on the contents, learning outcomes and, especially examination conditions are given on the module level only – see section "Assignment to Modules" above.
| additional remarks | Automata and formal languages are at the heart of all fields of computer science. In this course, knowledge from earlier years will be furthered. We shall focus on compiler and verification applications . Moreover, we shall investigate relations to logic, complexity, and algorithms . First, we will discuss the algorithmic complexity of known problems such as word and minimisation problems . The better part of the course will extend automata over finite words to automata over infinite words . Moreover, we will learn about algebraic properties of formal languages and about recognizability by various logics . Pushdown automata extend finite automata by a stack increasing the expressiveness of accepted languages. They have important applications in compilers (parsing) and verification (of pushdown systems). Tree automata accpeting trees instead of words, are used in the code selection phase of compilers and will be treated, too. Finally, we will introduce timed automata . They play an important role in real-time system modelling and verification. We will use the UPPAAL tool, which is heavily used also outside academia. |
|---|---|
| Links |
Additional information TUMonline entry |
Equivalent Courses (e. g. in other semesters)
| Semester | Title | Lecturers | Dates |
|---|---|---|---|
| WS 2023/4 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. |
Tue, 10:30–12:30, MI HS2 Mon, 10:00–12:00, MI HS2 |
| WS 2022/3 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. |
Tue, 10:30–12:30, MI HS2 Mon, 10:00–12:00, MI HS2 |
| WS 2021/2 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. |
Tue, 10:30–12:30, MI HS2 Mon, 10:00–12:00, MI HS2 |
| WS 2020/1 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. Kretinsky, J. |
Mon, 10:00–12:00, Interims I 102 Thu, 14:00–16:00, Interims I 102 |
| WS 2019/20 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. Kretinsky, J. |
Mon, 10:00–12:00, MIBE E.126 Thu, 14:00–16:00, MI 02.13.010 |
| WS 2018/9 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. |
Thu, 14:00–16:00, MI 02.13.010 Mon, 10:00–12:00, MIBE E.126 |
| WS 2017/8 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. |
Thu, 14:00–16:00, MI 02.13.010 Mon, 10:00–12:00, MI 02.13.010 Tue, 12:00–13:30, MI 02.13.010 and singular or moved dates |
| WS 2016/7 | Automata and Formal Languages (IN2041) | Esparza Estaun, F. | |
| WS 2015/6 | Automata and Formal Languages (IN2041) | ||
| WS 2012/3 | Automata and Formal Languages (IN2041) |