IB102 Automata, Grammars, and Complexity

Faculty of Informatics
Autumn 2016
Extent and Intensity
3/2. 5 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Jan Strejček, Ph.D. (lecturer)
RNDr. František Blahoudek (seminar tutor)
RNDr. Petra Budíková, Ph.D. (seminar tutor)
RNDr. Martin Jonáš (seminar tutor)
Mgr. Karel Kubíček (seminar tutor)
Mgr. Henrich Lauko (seminar tutor)
Mgr. Juraj Major (seminar tutor)
RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Martina Vitovská (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
Bc. Zuzana Baranová (assistant)
Mgr. Bc. Tomáš Janík (assistant)
Mgr. David Klaška (assistant)
Bc. Tadeáš Kučera (assistant)
Bc. Tomáš Lamser (assistant)
Bc. Kateřina Sloupová (assistant)
RNDr. Vladimír Štill (assistant)
Mgr. Eva Tesařová (assistant)
Mgr. Bc. Dominik Velan (assistant)
Supervisor
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
Timetable
Mon 9:00–11:50 D1, Mon 9:00–11:50 D3
  • Timetable of Seminar Groups:
IB102/T01: Mon 19. 9. to Thu 22. 12. Mon 13:00–15:30 KOM 106, Tue 20. 9. to Thu 22. 12. Tue 13:00–14:35 KOM 110, L. Másilko, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB102/T02: Mon 19. 9. to Thu 22. 12. Mon 13:00–15:30 KOM 114, O. Nečas, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB102/01: Fri 8:00–9:50 B410, F. Blahoudek
IB102/02: Thu 8:00–9:50 C525, F. Blahoudek
IB102/03: Wed 8:00–9:50 B410, P. Budíková
IB102/04: Thu 16:00–17:50 B204, M. Jonáš
IB102/05: Wed 16:00–17:50 C525, M. Jonáš
IB102/06: Mon 16:00–17:50 C525, K. Kubíček, M. Vitovská
IB102/07: Mon 18:00–19:50 A319, K. Kubíček
IB102/08: Tue 10:00–11:50 C511, H. Lauko
IB102/09: Tue 14:00–15:50 C525, J. Major
IB102/10: Thu 14:00–15:50 A217, V. Řehák
IB102/11: Thu 12:00–13:50 A217, V. Řehák
IB102/12: Wed 10:00–11:50 C525, J. Strejček
Prerequisites (v češtině)
( 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; explain the basics of complexity theory; apply these theories in common practice;
Syllabus
  • Finite automata and regular grammars: Pumping lemma, 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.
  • Turing machines, recursive and recursively enumerable languages, decidability of problems, reduction.
  • Computational complexity of algorithms and problems.
  • Complexity classes: polynomial reduction, completeness and hardness of problems, NP-complete problems.
Literature
    recommended literature
  • Č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
  • SIPSER, Michael. Introduction to the theory of computation. Boston: PWS Publishing Company, 1997. xv, 396 s. ISBN 0-534-94728-X. info
    not specified
  • 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
Czech
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 2017.
  • Enrolment Statistics (Autumn 2016, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2016/IB102

Go to top | Current date and time: 23. 2. 2018 21:08, Week 8 (even)

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 | Více o Informačním systému