Automata and Formal Languages
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Module version of WS 2015/6 (current)
There are historic module descriptions of this module. A module description is valid until replaced by a newer one.
|available module versions|
|WS 2015/6||WS 2011/2|
IN2041 is a semester module in English language at Bachelor’s level and Master’s level which is offered in winter semester.
This Module is included in the following catalogues within the study programs in physics.
- Catalogue of non-physics elective courses
|Total workload||Contact hours||Credits (ECTS)|
|240 h||90 h||8 CP|
Content, Learning Outcome and Preconditions
- use finite automata as a data structure for representation of finite and infinite sets;
- understand and determine the computational complexity of different operations for different classes of automata;
- move to and fro logical and automata-theoretic descriptions;
- apply automata to problems in pattern matching and formal verification.
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
|VO||4||Automata and Formal Languages (IN2041)||Esparza Estaun, F. Kretinsky, J.||
Thu, 14:00–16:00, MI 02.13.010
Mon, 10:00–12:00, MSB E.126
|UE||2||Exercise - Automata and Formal Languages (IN2041)||Esparza Estaun, F. Kretinsky, J. Lazic, M. Sickert, S. Weil-Kennedy, C.||
Tue, 10:00–12:00, MSB E.126
Learning and Teaching Methods
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman; Introduction to Automata Theory, Languages and Computation; Addison-Wesley Longman, 3rd edition, 2006.
Joerg Flum, Erich Graedel, Thomas Wilke (eds.); Logic and Automata: History and Perspectives, Volume 2; Amsterdam University Press, 2008.
Dominique Perrin, Jean-Eric Pin; Infinite Words: Automata, Semigroups, Logic and Games; Academic Press, 2004.
Description of exams and course work
The exam may be repeated at the end of the semester.