FI:IB005 Formal languages and Automata - Course Information
IB005 Formal Languages and Automata
Faculty of InformaticsSpring 2017
- Extent and Intensity
- 4/2/0. 6 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
RNDr. Martin Jonáš (seminar tutor)
Bc. Tomáš Lamser (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
doc. RNDr. Jan Strejček, Ph.D. (seminar tutor)
Bc. Katarína Kejstová (assistant)
Mgr. David Klaška (assistant)
Mgr. Juraj Major (assistant)
Bc. Miriama Sasaráková (assistant)
Bc. et Bc. Kateřina Sloupová (assistant)
Bc. Tatiana Zbončáková (assistant) - Supervisor
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Supplier department: Department of Computer Science - Faculty of Informatics - Timetable
- Wed 10:00–11:50 D2, Thu 10:00–11:50 D1
- Timetable of Seminar Groups:
IB005/02: Fri 8:00–9:50 B410, M. Jonáš
IB005/03: Thu 16:00–17:50 B411, M. Jonáš
IB005/04: Wed 18:00–19:50 A218, T. Lamser - Prerequisites
- IB000 Math. Foundations of CS && ! IB102 Automata, Grammars, Complexity
Knowlegde corresponding to the courses IB000 Mathematical Foundations of Computer Science - 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 19 fields of study the course is directly associated with, display
- Course objectives
- At the end of the course students should be able to understand and explain the rich heritage of models and abstractions that have arisen over the years, and to develop the students' capacity to form abstractions of their own and reason in terms of them.
- Syllabus
- Languages and grammars. Chomsky hierarchy.
- Finite automata and regular grammars.
- Properties of regular languages. Applications.
- Context-free grammars and pushdown automata.
- Properties of context-free languages.
- Turing machines (TM). Computable languages and functions, LBA. Properties of recursive and recursive enumerable languages.
- Undecidability, halting problem for TM, Reduction, Post Correspondece Problem, undecidable problems from language theory.
- 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
- GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997. xv, 716 s. ISBN 1-85032-243-0. 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
- CHYTIL, Michal. Automaty a gramatiky. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1984. 331 s. info
- KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0387949070. info
- SIPSER, Michael. Introduction to the theory of computation. 2nd ed. Boston: Thomson Course Technology, 2006. xix, 431. ISBN 0534950973. info
- Teaching methods
- Lectures, tutorials/exercises, and reading. Optional homeworks.
- Assessment methods
- Lectures and exercises. Optional homeworks. One midterm written exam and written final exam. Grading for the course: 20% midterm exam, 80% the final exam. Exams are written without any reading materials (closed book).
- Language of instruction
- Czech
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- Teacher's information
- http://www.fi.muni.cz/usr/kretinsky/fja1.html
- Enrolment Statistics (Spring 2017, recent)
- Permalink: https://is.muni.cz/course/fi/spring2017/IB005