IB005 Formal Languages and Automata

Faculty of Informatics
Spring 2017
Extent and Intensity
4/2/0. 6 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
RNDr. Martin Jonáš, Ph.D. (seminar tutor)
Bc. Tomáš Lamser (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
doc. RNDr. Jan Strejček, Ph.D. (seminar tutor)
Mgr. Miriama Jánošová (assistant)
Mgr. Katarína Kejstová (assistant)
RNDr. David Klaška (assistant)
Mgr. Juraj Major (assistant)
Mgr. Bc. Kateřina Sloupová (assistant)
Mgr. Tatiana Zbončáková (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.
Supplier department: Department of Computer Science - Faculty of Informatics
Wed 10:00–11:50 D2, Thu 10:00–11:50 D1
  • Timetable of Seminar Groups:
IB005/01: Wed 14:00–15:50 A217, except Wed 10. 5., J. Strejček
IB005/02: Fri 8:00–9:50 B410, M. Jonáš
IB005/03: Thu 16:00–17:50 B411, M. Jonáš
IB005/04: Wed 18:00–19:50 A218, T. Lamser
IB000 Math. Foundations of CS && ! IB102 Automata, Grammars, Complexity
Knowlegde corresponding to the courses IB000 Mathematical Foundations of Computer Science
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
there are 19 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and explain the rich heritage of models and abstractions that have arisen over the years, and to develop the students' capacity to form abstractions of their own and reason in terms of them.
  • Languages and grammars. Chomsky hierarchy.
  • Finite automata and regular grammars.
  • Properties of regular languages. Applications.
  • Context-free grammars and pushdown automata.
  • Properties of context-free languages.
  • Turing machines (TM). Computable languages and functions, LBA. Properties of recursive and recursive enumerable languages.
  • Undecidability, halting problem for TM, Reduction, Post Correspondece Problem, undecidable problems from language theory.
  • ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Formální jazyky a automaty I. Elportál. Brno: Masarykova univerzita, 2006. ISSN 1802-128X. URL info
  • GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997. xv, 716 s. ISBN 1-85032-243-0. info
  • HOPCROFT, John E. and Jeffrey D. ULLMAN. Introduction to automata theory, languages, and computation. Reading: Addison-Wesley Publishing Company, 1979. 418 s., ob. ISBN 0-201-02988-X. info
  • 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
  • SIPSER, Michael. Introduction to the theory of computation. 2nd ed. Boston: Thomson Course Technology, 2006. xix, 431. ISBN 0534950973. info
Teaching methods
Lectures, tutorials/exercises, and reading. Optional homeworks.
Assessment methods
Lectures and exercises. Optional homeworks. One midterm written exam and written final exam. Grading for the course: 20% midterm exam, 80% the final exam. Exams are written without any reading materials (closed book).
Language of instruction
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
Teacher's information
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023.
  • Enrolment Statistics (Spring 2017, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2017/IB005