IB102 Automata and Grammars

Faculty of Informatics
Autumn 2011
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
doc. RNDr. Jan Strejček, Ph.D. (lecturer)
RNDr. František Blahoudek, Ph.D. (seminar tutor)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Petra Budíková, Ph.D. (seminar tutor)
RNDr. Milan Češka, Ph.D. (seminar tutor)
RNDr. Jan Krčál, Ph.D. (seminar tutor)
Mgr. Petr Kunc (seminar tutor)
RNDr. Petr Novotný, Ph.D. (seminar tutor)
RNDr. Mária Svoreňová, Ph.D. (seminar tutor)
RNDr. Jana Tůmová, Ph.D. (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (assistant)
Mgr. Lukáš Másilko (assistant)
Mgr. Jiří Uhlíř (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: doc. RNDr. Jan Strejček, Ph.D.
Mon 10:00–11:50 D1, Mon 10:00–11:50 D3
  • Timetable of Seminar Groups:
IB102/A: Thu 10:00–11:50 B204, J. Strejček
IB102/01: Wed 10:00–11:50 B410, F. Blahoudek
IB102/02: Wed 12:00–13:50 B204, F. Blahoudek
IB102/03: Thu 8:00–9:50 C511, J. Bouda
IB102/04: Thu 10:00–11:50 C511, J. Bouda
IB102/05: Thu 8:00–9:50 B204, P. Budíková
IB102/06: Mon 12:00–13:50 B410, M. Češka
IB102/07: Thu 12:00–13:50 G101, J. Krčál
IB102/08: Thu 14:00–15:50 G101, J. Krčál
IB102/09: Tue 18:00–19:50 B410, P. Kunc
IB102/10: Tue 8:00–9:50 G101, P. Novotný
IB102/11: Tue 10:00–11:50 G101, P. Novotný
IB102/12: Mon 18:00–19:50 G125, M. Svoreňová
IB102/13: Thu 16:00–17:50 B204, J. Tůmová
IB102/14: Fri 12:00–13:50 C511, J. Tůmová
IB102/15: Mon 14:00–15:50 B410, J. Strejček
Prerequisites (in Czech)
( MB101 Mathematics I || MB005 Foundations of mathematics )&& ! IB005 Formal languages and Automata
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 28 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to: explain the basics of theory of formal languages and automata; apply this theory in common practice;
  • Finite automata and regular grammars: Pumping lemma, Myhill-Nerode theorem, minimization of finite automata.
  • Properties of regular languages: closure properties, Kleene theorem, regular expressions.
  • Context-free grammars and languages: transformation of context-free grammars, selected normal forms, Pumping lemma, closure properties.
  • Pushdown automata and their relation to context-free grammars: top-down and bottom-up nondeterministic syntax analysis.
  • Deterministic pushdown automata.
  • Č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
  • MOLNÁR, L'udovít, Milan ČEŠKA and Bořivoj MELICHAR. Gramatiky a jazyky. 1. vyd. Bratislava: Alfa, 1987. 188 s. 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
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0387949070. info
  • SIPSER, Michael. Introduction to the theory of computation. Boston: PWS Publishing Company, 1997. xv, 396 s. ISBN 0-534-94728-X. info
Teaching methods
Lectures and class exercises
Assessment methods
Optional homeworks. Written intrasemestral test and written final test. Results of the intrasemestral test is included in the overall evaluation. Tests are written without any reading materials.
Language of instruction
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
The course is also listed under the following terms Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2011, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2011/IB102