IA006 Selected topics on automata theory

Faculty of Informatics
Autumn 2008
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
prof. RNDr. Jiří Barnat, Ph.D. (seminar tutor)
prof. RNDr. Jan Strejček, Ph.D. (seminar tutor)
RNDr. Václav Brožek, Ph.D. (assistant)
doc. RNDr. Milan Češka, Ph.D. (assistant)
RNDr. Vojtěch Forejt, Ph.D., LL.B. (Hons) (assistant)
RNDr. Jana Tůmová, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Timetable
Wed 10:00–11:50 D1
  • Timetable of Seminar Groups:
IA006/01: each even Thursday 10:00–11:50 B204, J. Barnat
IA006/02: each odd Thursday 10:00–11:50 B204, J. Barnat
IA006/03: each even Thursday 12:00–13:50 B011, J. Barnat
IA006/04: each odd Thursday 12:00–13:50 B011, J. Barnat
IA006/05: each even Tuesday 10:00–11:50 B204, J. Strejček
IA006/06: each odd Tuesday 10:00–11:50 B204, J. Strejček
Prerequisites
Knowlegde corresponding to the courses IB005 - Formal languages and automata and IB107 - Computability and complexity
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
The purpose of this course is to introduce computer science students to selected advanced parts of automata theory (including infinite words, bisimulations,...) and to understand methods of their applications.
Syllabus
  • Methods of syntactic analyses of detCFLs.
  • LL(k) grammars and languages, properties and analyzers.
  • LR(k) grammars and languages, properties and analyzers.
  • Relationships between LL, LR and detCFL.
  • Transition systems and nondeterminism - bisimulation. Selected decidable problems related to process verification.
  • Automata and infinite words: infinite words, regular (rational) sets of infinite words.
  • Automata: deterministic and nondeterministic Buchi automata, Muller, Rabin, and Street automata. McNaughton theorem. Relationships.
Literature
  • CHYTIL, Michal. Automaty a gramatiky. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1984, 331 s. URL info
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997, xiii, 400. ISBN 0387949070. info
  • Handbook of formal languages. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997, xxiv, 873. ISBN 3540614869. info
  • Handbook of formal languages. Edited by Grzegorz Rozenberg - Arto Salomaa. Berlin: Springer-Verlag, 1997, xx, 625. ISBN 3540614869. info
  • SIPPU, Seppo and Eljas SOISALON-SOININEN. Parsing theory : volume 2 : LR(k)and LL(k) parsing. Berlin: Springer-Verlag, 1990, 417 s. ISBN 0-387-51732-4. info
  • další odkazy na studijní literaturu jsou uvedeny na webové stránce předmětu.
Assessment methods
Lectures and exercises. Optional homeworks. One midterm written exam and written final exam. Grading for the course: 25% the midterm exam, 75% the final exam. Exams are written without any reading materials (closed book).
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/fja2.html
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024.
  • Enrolment Statistics (Autumn 2008, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2008/IA006