IB102 Automata, Grammars, and Complexity

Faculty of Informatics
Autumn 2013
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)
Mgr. František Blahoudek (seminar tutor)
RNDr. Petra Budíková, Ph.D. (seminar tutor)
Bc. Pavel Čadek (seminar tutor)
Mgr. Ľuboš Korenčiak (seminar tutor)
Bc. Petr Kunc (seminar tutor)
Bc. Zuzana Petruchová (seminar tutor)
RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Marek Trtík (seminar tutor)
RNDr. Jana Tůmová (seminar tutor)
Bc. Jiří Uhlíř (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (assistant)
RNDr. Milan Češka, Ph.D. (assistant)
Lukáš Ďurovský (assistant)
Bc. Jan Fikejs (assistant)
Mgr. Lukáš Másilko (assistant)
RNDr. Ondrej Moriš (assistant)
RNDr. Petr Novotný (assistant)
Mgr. Tomáš Sklenák (assistant)
Mgr. Mária Svoreňová (assistant)
Vladimír Štill (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.
Dodavatelské pracoviště: Department of Computer Science - Faculty of Informatics
Prerequisites (in Czech)
( IB000 Math. Foundations of CS || PřF:M1125 Fundamentals of Mathematics )&&! IB005 Formal languages and Automata
Course Enrollment 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, 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.
  • Turing machines, recursive and recursively enumerable languages.
  • Computational complexity of algorithms and problems.
  • Complexity classes: polynomial reduction, completeness and hardness of problems, NP-complete problems.
Literature
    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-. info
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0-387-94907-0. info
  • SIPSER, Michael. Introduction to the theory of computation. Boston: PWS Publishing Company, 1997. xv, 396 s. ISBN 0-534-94728-. 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.
Follow-Up Courses
Further Comments
The course is taught annually.
The course is taught: every week.
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.
  • Enrollment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2013/IB102

Other references: 

Go to top | Current date and time: 22. 5. 2013 16:05, Week 21 (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 | learn more about Information System