FI:IB102 Automata and Grammars - Course Information

IB102 Automata and Grammars

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)
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)
prof. Dr. rer. nat. RNDr. Mgr. Bc. Jan Křetínský, Ph.D. (seminar tutor)
Mgr. Jitka Kudrnáčová (seminar tutor)
RNDr. Jana Tůmová, Ph.D. (seminar tutor)
Mgr. Lucie Brožková (assistant)
prof. RNDr. Ivana Černá, CSc. (assistant)
RNDr. Jakub Chaloupka, Ph.D. (assistant)
Mgr. Pavel Moravec (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: Mon 14:00–15:50 B410, T. Babiak
IB102/02: Wed 12:00–13:50 B011, N. Beneš
IB102/03: Wed 14:00–15:50 B410, M. Češka
IB102/04: Thu 10:00–11:50 B410, V. Brožek
IB102/05: Wed 18:00–19:50 B410, N. Beneš
IB102/06: Mon 12:00–13:50 B007, V. Forejt
IB102/07: Mon 14:00–15:50 B007, V. Forejt
IB102/08: Tue 12:00–13:50 B011, J. Křetínský
IB102/09: Mon 12:00–13:50 B410, J. Kudrnáčová
IB102/10: Wed 10:00–11:50 B003, V. Brožek
IB102/11: Wed 12:00–13:50 C511, J. Strejček
IB102/12: Mon 12:00–13:50 B003, J. Tůmová
IB102/13: Mon 14:00–15:50 B003, J. Tůmová
IB102/14: Thu 14:00–15:50 B003, B. Bühnová
IB102/15: Thu 16:00–17:50 B003, B. Bühnová
IB102/16: Wed 16:00–17:50 B204, J. Strejček

Prerequisites (in Czech)

( MB101 Mathematics I || MB005 Foundations 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

• Applied Informatics (programme FI, B-AP)
• Bioinformatics (programme FI, B-AP)
• Informatics with another discipline (programme FI, B-BI)
• Informatics with another discipline (programme FI, B-FY)
• Informatics with another discipline (programme FI, B-GE)
• Informatics with another discipline (programme FI, B-GK)
• Informatics with another discipline (programme FI, B-CH)
• Informatics with another discipline (programme FI, B-IO)
• Informatics with another discipline (programme FI, B-MA)
• Informatics with another discipline (programme FI, B-SO)
• Informatics with another discipline (programme FI, B-TV)
• Informatics (programme FI, B-IN)
• Mathematical Informatics (programme FI, B-IN)
• Parallel and Distributed Systems (programme FI, B-IN)
• Computer Graphics and Image Processing (programme FI, B-IN)
• Computer Networks and Communication (programme FI, B-IN)
• Computer Systems and Data Processing (programme FI, B-IN)
• Programmable Technical Structures (programme FI, B-IN)
• Upper Secondary School Teacher Training in Physical Education (programme FSpS, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

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

• Č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
• 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 2007, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2007/IB102