I005 Formal Languages and Automata I

Faculty of Informatics
Spring 1997
Extent and Intensity
3/1. 4 credit(s). 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)
Guaranteed by
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Prerequisites
Recommended I000 Induction and Recursion and M005 Foundations of mathematics
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.
Language of instruction
Czech
The course is also listed under the following terms Spring 1995, Autumn 1995, Spring 1996, Spring 1998, Spring 1999, Spring 2000, Spring 2001, Spring 2002.
  • Enrolment Statistics (Spring 1997, recent)
  • Permalink: https://is.muni.cz/course/fi/spring1997/I005