IB102 Automata and Grammars

Faculty of Informatics
Autumn 2012
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Jan Strejček, Ph.D. (lecturer)
RNDr. František Blahoudek, Ph.D. (seminar tutor)
RNDr. Petra Budíková, Ph.D. (seminar tutor)
Mgr. Pavel Čadek, DiS. (seminar tutor)
Mgr. Ľuboš Korenčiak, Ph.D. (seminar tutor)
Mgr. Petr Kunc (seminar tutor)
Mgr. Zuzana Petruchová (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Marek Trtík, Ph.D. (seminar tutor)
RNDr. Jana Tůmová, Ph.D. (seminar tutor)
Mgr. Jiří Uhlíř (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (assistant)
doc. RNDr. Milan Češka, Ph.D. (assistant)
Mgr. Lukáš Ďurovský (assistant)
Mgr. Jan Fikejs (assistant)
Mgr. Lukáš Másilko (assistant)
RNDr. Ondrej Moriš (assistant)
doc. RNDr. Petr Novotný, Ph.D. (assistant)
Mgr. et Mgr. Tomáš Sklenák (assistant)
RNDr. Mária Svoreňová, Ph.D. (assistant)
RNDr. Vladimír Štill, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jan Strejček, Ph.D.
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 10:00–11:50 D3, Mon 10:00–11:50 D1
  • Timetable of Seminar Groups:
IB102/A: Mon 14:00–15:50 B411, J. Strejček
IB102/T01A: Thu 20. 9. to Fri 21. 12. Thu 8:00–9:55 Učebna S11 (58), L. Másilko
IB102/T01AA: Mon 8:00–10:55 Učebna S11 (58), L. Másilko
IB102/01: Tue 12:00–13:50 B410, F. Blahoudek
IB102/02: Thu 8:00–9:50 C511, F. Blahoudek
IB102/03: Wed 14:00–15:50 C511, P. Budíková
IB102/04: Wed 16:00–17:50 C511, P. Budíková
IB102/05: Tue 14:00–15:50 G123, P. Čadek
IB102/06: Mon 16:00–17:50 G125, Ľ. Korenčiak
IB102/07: Mon 18:00–19:50 G125, Ľ. Korenčiak
IB102/08: Thu 18:00–19:50 C511, P. Kunc
IB102/09: Mon 12:00–13:50 G126, Z. Petruchová
IB102/10: Tue 10:00–11:50 G126, V. Řehák
IB102/11: Wed 12:00–13:50 B410, J. Strejček
IB102/12: Mon 12:00–13:50 B410, J. Tůmová
IB102/13: Fri 12:00–13:50 C511, J. Uhlíř
IB102/14: Fri 14:00–15:50 C511, J. Uhlíř
IB102/15: Tue 18:00–19:50 G124, M. Trtík
Prerequisites (in Czech)
( MB101 Linear models || IB112 Math Foundations || 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 / plans 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;
Syllabus
  • 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.
Literature
    not specified
  • MOLNÁR, Ľudovít and Bořivoj MELICHAR. Gramatiky a jazyky. Online. Edited by Milan Češka. 1. vyd. Bratislava: Alfa, vydavateľstvo technickej a ekonomickej literatúry, 1987. 188 s. [citováno 2024-04-23] info
  • HOPCROFT, John E. and Jeffrey D. ULLMAN. Introduction to automata theory, languages, and computation. Online. Reading: Addison-Wesley Publishing Company, 1979. 418 s., ob. ISBN 0-201-02988-X. [citováno 2024-04-23] info
  • KOZEN, Dexter C. Automata and computability. Online. New York: Springer, 1997. xiii, 400. ISBN 0387949070. [citováno 2024-04-23] info
  • SIPSER, Michael. Introduction to the theory of computation. Online. Boston: PWS Publishing Company, 1997. xv, 396 s. ISBN 0-534-94728-X. [citováno 2024-04-23] 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
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 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2012/IB102