IB102 Automata and Grammars

Faculty of Informatics
Autumn 2004
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ivana Černá, CSc. (lecturer)
prof. RNDr. Jiří Barnat, Ph.D. (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
doc. Ing. RNDr. Barbora Bühnová, Ph.D. (seminar tutor)
Mgr. Jan Holeček (seminar tutor)
RNDr. Jakub Chaloupka, Ph.D. (seminar tutor)
Mgr. Pavel Moravec (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Oldřich Stražovský (seminar tutor)
RNDr. Pavel Šimeček, Ph.D. (seminar tutor)
Mgr. Jiří Šimša (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: prof. RNDr. Ivana Černá, CSc.
Timetable
Tue 12:00–13:50 D3, Tue 12:00–13:50 D1
  • Timetable of Seminar Groups:
IB102/01: Thu 10:00–11:50 B410, J. Barnat
IB102/02: Thu 8:00–9:50 B011, V. Řehák
IB102/03: Thu 10:00–11:50 B011, V. Řehák
IB102/04: Wed 12:00–13:50 B011, P. Moravec
IB102/05: Thu 8:00–9:50 C525, P. Moravec
IB102/06: Thu 14:00–15:50 B204, B. Bühnová
IB102/07: Thu 16:00–17:50 B204, B. Bühnová
IB102/08: Fri 8:00–9:50 B204, J. Chaloupka
IB102/09: Thu 12:00–13:50 B011, O. Stražovský
IB102/10: Wed 16:00–17:50 B011, J. Holeček
IB102/11: Fri 12:00–13:50 B204, N. Beneš
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 the course is directly associated with
there are 13 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
  • 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
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997. xiii, 400. ISBN 0387949070. info
  • MOLNÁR, L'udovít, Milan ČEŠKA and Bořivoj MELICHAR. Gramatiky a jazyky. 1. vyd. Bratislava: Alfa, 1987. 188 s. 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ích písemek se započítávají do výsledného hodnocení. Všechny písemky bez pomocných materiálů.
Language of instruction
Czech
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/cerna/AaG/ib102.html
The course is also listed under the following terms Autumn 2003, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2004, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2004/IB102