Automata and Grammars | Pavel Surynek's Academic Page

Automata and Grammars (NTIN071)

Introduction  |  Lecture  |  Seminar     

Hide menu   Show menu   Jump to the bottom   Print page

Motivaní obrázek

Introductory course on theory of formal languages. The course covers essential concepts necessary for further study of computer science.

The course covers the following topics among others:

  • formal languages, finite automata, non-determinism, regular expressions
  • enhanced automata - bi-directional, push-down
  • grammars, Chomsky hierarchy
  • Turing machines, algorithmically undecidable problems

The course is provided in Czech and English language and is accompanied by a seminar. Attandants can chose one of several seminars taught in Czech. One seminar is provided in English language.

Schedule: Summer semester, 2/2 Z+Zk, Wednesday 9:00-10:30 S9 (lecture in Czech) and Thursday 9:00-10:30 S7 (lecture in English)

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.

Hide menu   Show menu   Jump to the top   Print page