I005 Formal Languages and Automata I

Faculty of Informatics
Spring 2002
Extent and Intensity
3/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer), prof. RNDr. Ivana Černá, CSc. (deputy)
prof. RNDr. Ivana Černá, CSc. (seminar tutor)
prof. RNDr. Jiří Barnat, Ph.D. (seminar tutor)
doc. RNDr. Tomáš Brázdil, Ph.D. (seminar tutor)
Mgr. BcA. Robert Král, Ph.D. (seminar tutor)
Mgr. Pavel Krčál (seminar tutor)
Mgr. Jaroslav Műller (seminar tutor)
doc. Mgr. Radek Pelánek, Ph.D. (seminar tutor)
RNDr. Jaroslav Ráček, Ph.D. (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Radek Sedláček, Ph.D. (seminar tutor)
Mgr. Oldřich Stražovský (seminar tutor)
Guaranteed by
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.
Timetable of Seminar Groups
I005/01: Thu 13:00–14:50 B011, J. Barnat
I005/01plus: No timetable has been entered into IS. J. Barnat
I005/02: Thu 15:00–16:50 B011, J. Barnat
I005/02plus: No timetable has been entered into IS. J. Barnat
I005/A: Thu 9:00–10:50 B410, I. Černá
I005/pondel: Mon 12:00–14:50 D1, M. Křetínský
I005/streda: Wed 14:00–16:50 D1, M. Křetínský
I005/03: Thu 17:00–18:50 B011, R. Pelánek
I005/04: Fri 8:00–9:50 B003, V. Řehák
I005/05: Thu 13:00–14:50 C416, J. Ráček
I005/06: Thu 15:00–16:50 C416, J. Ráček
I005/07: Thu 15:00–16:50 B003, J. Műller
I005/08: Thu 17:00–18:50 B003, R. Sedláček
I005/09: Thu 11:00–12:50 B007, P. Krčál
I005/10: Fri 8:00–9:50 B204, T. Brázdil
I005/11: Thu 9:00–10:50 B011, R. Sedláček
I005/12: Thu 9:00–10:50 B007, V. Řehák
I005/13: Thu 11:00–12:50 B011, R. Král
I005/14: Fri 10:00–11:50 B204, R. Král
I005/15: Thu 9:00–10:50 B003, J. Ráček
I005/17: Fri 10:00–11:50 B410, O. Stražovský
I005/18: Thu 13:00–14:50 B410, P. Krčál
Prerequisites
I000 Induction and Recursion && ( M005 Foundations of mathematics || M036 Rings and modules || PřF:M3510 Algebra III ) && (! I505 Formal Languages and Automata I )&& (!NOW( I505 Formal Languages and Automata I ))
I000 Induction and Recursion and M005 Foundations of mathematics required
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
Syllabus
  • Languages and grammars. Chomsky hierarchy.
  • Finite automata and regular grammars.
  • Properties of regular languages.
  • Context-free grammars and pushdown automata.
  • Properties of context-free languages.
  • Deterministic pushdown automata.
  • Turing machines. Computable languages and functions.
  • Undecidability, (semi)decidability. Halting problem for TM.
  • Post's correspondence problem. Undecidable CFL problems.
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
  • CHYTIL, Michal. Automaty a gramatiky. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1984, 331 s. URL info
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997, xiii, 400. ISBN 0387949070. info
Assessment methods (in Czech)
2 písemné zkoušky během semestru a závěrečná písemná zkouška.
Language of instruction
Czech
Follow-Up Courses
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/fja1.html
The course is also listed under the following terms Spring 1995, Autumn 1995, Spring 1996, Spring 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2001.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2002/I005