FI:IB102 Automata and Grammars - Course Information
IB102 Automata and Grammars
Faculty of InformaticsAutumn 2006
- 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. Tomáš Babiak, Ph.D. (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Václav Brožek, Ph.D. (seminar tutor)
doc. Ing. RNDr. Barbora Bühnová, Ph.D. (seminar tutor)
doc. RNDr. Milan Češka, Ph.D. (seminar tutor)
RNDr. Vojtěch Forejt, Ph.D., LL.B. (Hons) (seminar tutor)
RNDr. Jakub Chaloupka, Ph.D. (seminar tutor)
Mgr. Jitka Kudrnáčová (seminar tutor)
Mgr. Pavel Moravec (seminar tutor)
RNDr. Pavel Šimeček, Ph.D. (seminar tutor)
Mgr. Jiří Šimša (seminar tutor)
RNDr. Jana Tůmová, Ph.D. (seminar tutor)
prof. RNDr. Jiří Barnat, 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. - Timetable
- Mon 10:00–11:50 D3, Mon 10:00–11:50 D1
- Timetable of Seminar Groups:
IB102/01: Fri 10:00–11:50 B410, T. Babiak
IB102/02: Tue 16:00–17:50 B007, N. Beneš
IB102/03: Tue 18:00–19:50 B007, N. Beneš
IB102/04: Wed 10:00–11:50 B410, V. Brožek
IB102/05: Thu 18:00–19:50 B011, M. Češka
IB102/06: Tue 12:00–13:50 B011, V. Forejt
IB102/07: Thu 10:00–11:50 B410, J. Chaloupka
IB102/08: Thu 18:00–19:50 B410, J. Kudrnáčová
IB102/09: Mon 18:00–19:50 B007, P. Moravec
IB102/10: Tue 16:00–17:50 B011, J. Strejček
IB102/11: Fri 8:00–9:50 B007, P. Šimeček
IB102/12: Thu 12:00–13:50 C511, J. Bouda
IB102/13: Wed 12:00–13:50 B003, J. Šimša
IB102/14: Thu 16:00–17:50 B011, J. Tůmová
IB102/15: Mon 16:00–17:50 B204, B. Bühnová
IB102/16: Mon 12:00–13:50 B410, P. Moravec - Prerequisites (in Czech)
- ! I005 Formal Languages and Automata I &&! I505 Formal Languages and Automata I &&( MB101 Mathematics I || MB005 Foundations of mathematics || M005 Foundations of mathematics )&& ! IB005 Formal languages and Automata
- Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 14 fields of study the course is directly associated with, display
- Course objectives
- The purpose of this course is twofold: to introduce computer science students to the rich heritage of models and abstractions that have arisen over the years, and to develop the capacity to form abstractions of their own and reason in terms of them.
- Syllabus
- Finite automata and regular grammars.
- Properties of regular languages. Applications.
- Context-free grammars and pushdown automata.
- Properties of context-free languages.
- Deterministic pushdown automata. Applications
- Literature
- I.Černá, M.Křetínský, A.Kučera: FJA I, interní materiál FI MU
- MOLNÁR, Ľudovít and Bořivoj MELICHAR. Gramatiky a jazyky. Edited by Milan Češka. 1. vyd. Bratislava: Alfa, vydavateľstvo technickej a ekonomickej literatúry, 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
- SIPSER, Michael. Introduction to the theory of computation. Boston: PWS Publishing Company, 1997, xv, 396 s. ISBN 0-534-94728-X. info
- Assessment methods (in Czech)
- Písemná zkouška během semestru a závěrečná písemná zkouška. Výsledky vnitrosemestrální písemky se započítávají do výsledného hodnocení. Všechny písemky bez pomocných materiálů. Podrobné informace na http://www.fi.muni.cz/~xstrejc/IB102/
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- http://www.fi.muni.cz/~xstrejc/IB102/
- Enrolment Statistics (Autumn 2006, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2006/IB102