Course details

Modern Theoretical Computer Science

TID Acad. year 2021/2022 Winter semester

This course discusses advanced topics of theoretical computer science. It concentrates on the very recent research in the area of automata, formal languages, formal models, computability, complexity, and translation. The relation between theoretical computer science and mathematics is explained in detail. Philosophical aspects of theoretical computer science are discussed as well.

Topics for the state doctoral exam (SDZ):

  1. Normal Forms for General Grammars.
  2. Regulated Grammars.
  3. Matrix Grammars.
  4. Programmed Rewriting.
  5. Random Context Grammars.
  6. CD Grammar Systems.
  7. PC Grammar Systems.
  8. L Systems.
  9. Scattered Context Grammars.
  10. Transducers.


Course coordinator

Language of instruction

Czech, English


Examination (oral)

Time span

39 hrs lectures, 13 hrs projects

Assessment points

60 pts exam, 40 pts projects




Course Web Pages

Public course pages (in Czech, materials are in English)

Subject specific learning outcomes and competences

Thorough grasp of concepts and results achieved in modern theoretical computer science.

Learning objectives

To give an in-depth overview of modern theoretical computer science. Most importantly, to present the latest research in the area of automata, formal languages, formal models, computability, complexity, and translation.

Prerequisite knowledge and skills

Formal languages.

Study literature

  • MEDUNA Alexander: Automata and Languages. London, Springer, 2000
  • Kopie přednášek
  • HOPCROFT John E., MOTWANI Rajeev, ULLMAN Jeffrey D. Introduction to Automata Theory, Languages, and Computation (3rd ed.). Pearson, 2013. ISBN 978-1-2920-3905-3
  • MEDUNA Alexander a TECHET Jiří. Scattered Context Grammars and their Applications. WIT Press, UK, 2010. ISBN 978-1-84564-426-0
  • MEDUNA Alexander a ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9
  • mnoho nejnovějších článků, vědeckých zpráv a knih

Syllabus of lectures

  1. Introduction.
  2. Regulated formal models: principles.
  3. Matrix grammars.
  4. Parallel grammars.
  5. Random-context grammars.
  6. Left versions of regulated grammars.
  7. Hierarchy of Language Families Resulting from Regulated Grammars.
  8. CD Grammar Systems.
  9. PC Grammar Systems.
  10. L systems.
  11. Semi-parallel formal models; multi-grammars.
  12. Scattered context grammars.
  13. New versions of classical automata.
  14. Current trends; summary.

Syllabus - others, projects and individual work of students

Two essays based on selected scientific studies dealing with the teoretical computer science area.

Controlled instruction

1. Two papers during the semester:

  • 20 points each = 15 for essay + 5 for presentation.
  • The topic has to be related to the topic of the course and approved by guarantee (Prof. Meduna).
  • The paper has to be submitted by Monday of the week of presentation. Send it by email to, with a subject "TID-paper". Attention! If the paper is sent on Tuesday of the week of presentation, loss of 5 points follows. Any later sending will be discussed individually.
  • After the presentation, the paper can be improved and re-submit.

2. Oral exam consists of two questions, 30 points each.


Tuelecturelectures C216 11:0013:50 1DVI xx

Course inclusion in study plans

Back to top