IB102 Automata and Grammars

Faculty of Informatics
Autumn 2017
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)
Mgr. Marek Chalupa (seminar tutor)
RNDr. Martin Jonáš (seminar tutor)
Bc. Henrich Lauko (seminar tutor)
Mgr. Juraj Major (seminar tutor)
RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Bc. Kateřina Sloupová (seminar tutor)
Bc. Martina Vitovská (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
Bc. Zuzana Baranová (assistant)
RNDr. František Blahoudek (assistant)
RNDr. Petra Budíková, Ph.D. (assistant)
Mgr. David Klaška (assistant)
Dominika Krejčí (assistant)
Bc. Tadeáš Kučera (assistant)
Bc. Tomáš Lamser (assistant)
Miriama Sasaráková (assistant)
Mgr. Vladimír Štill (assistant)
Mgr. Bc. Dominik Velan (assistant)
Tatiana Zbončáková (assistant)
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: doc. RNDr. Jan Strejček, Ph.D.
Supplier department: Department of Computer Science - Faculty of Informatics
Mon 10:00–11:50 D3, Mon 10:00–11:50 D1
  • Timetable of Seminar Groups:
IB102/01: Fri 8:00–9:50 C525, M. Chalupa
IB102/02: Wed 16:00–17:50 C511, M. Jonáš
IB102/03: Mon 12:00–13:50 C511, M. Jonáš
IB102/04: Wed 14:00–15:50 C511, H. Lauko
IB102/05: Mon 14:00–15:50 B410, J. Major
IB102/06: Thu 16:00–17:50 A318, V. Řehák
IB102/07: Thu 8:00–9:50 A319, V. Řehák
IB102/08: Thu 18:00–19:50 C525, K. Sloupová
IB102/09: Thu 14:00–15:50 B410, J. Strejček
IB102/10: Wed 10:00–11:50 B410, M. Vitovská
IB102/11: Tue 18:00–19:50 B410, M. Vitovská
Prerequisites (in Czech)
( IB000 Math. Foundations of CS || PřF:M1125 Fundamentals 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 the course is directly associated with
there are 22 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;
Learning outcomes
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;
  • Motivation: finite reprezentation of infinite languages.
  • Finite automata and regular grammars: Pumping lemma, Myhill-Nerode theorem, minimization of finite automata, nondeterministic finite automata.
  • Properties of regular languages: closure properties, regular expressions, Kleene theorem.
  • 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.
  • Turing machines, recursive and recursively enumerable languages.
    not specified
  • SIPSER, Michael. Introduction to the theory of computation. Boston: PWS Publishing Company, 1997. xv, 396 s. ISBN 0-534-94728-X. 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
Teaching methods
Lectures and class exercises
Assessment methods
Optional homework exercises. Written midterm test and written final test. Results of the midterm test are 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 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2017/IB102

Go to top | Current date and time: 26. 9. 2017 00:26, Week 39 (odd)

Contact: istech(zavináč/atsign)fi(tečka/dot)muni(tečka/dot)cz, Office for Studies, access rights administrators, is-technicians, e-technicians, IT support | Use of cookies | learn more about Information System