Course detail

Modern Theoretical Computer Science

FIT-TIDAcad. year: 2024/2025

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.

Language of instruction

Czech

Mode of study

Not applicable.

Guarantor

prof. RNDr. Alexandr Meduna, CSc.

Department

Department of Information Systems (UIFS)

Entry knowledge

Formal languages.

Rules for evaluation and completion of the course

1. Write a paper during the semester:

  • Assessment: 40 points, where 30 for the paper itself and 10 for oral presentation (in English).
  • The topic should be related to the topic of your dissertation and the theoretical computer science. It has to be approved by guarantee (prof. Meduna).
  • The paper has to be electronically submitted a week before its oral presentation by email to meduna@fit.vut.cz, with a subject "TID-paper". Attention! If the paper is sent after the deadline, you lose approx. 10 points for each day of the delay.
  • After the presentation, the paper can be improved and re-submitted.

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

Aims

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.
Thorough grasp of concepts and results achieved in modern theoretical computer science.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

Kopie přednášek
MEDUNA Alexander: Automata and Languages. London, Springer, 2000
mnoho nejnovějších článků, vědeckých zpráv a knih

Classification of course in study plans

  • Programme DIT Doctoral 0 year of study, winter semester, compulsory-optional
  • Programme DIT Doctoral 0 year of study, winter semester, compulsory-optional
  • Programme DIT-EN Doctoral 0 year of study, winter semester, compulsory-optional
  • Programme DIT-EN Doctoral 0 year of study, winter semester, compulsory-optional

  • Programme IT-DR-1H Doctoral

    specialization DRH , 0 year of study, winter semester, elective

  • Programme CSE-PHD-4 Doctoral

    branch DVI4 , 0 year of study, winter semester, elective

  • Programme CSE-PHD-4 Doctoral

    branch DVI4 , 0 year of study, winter semester, elective

  • Programme CSE-PHD-4 Doctoral

    branch DVI4 , 0 year of study, winter semester, elective

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.

Syllabus

  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.

Guided consultation in combined form of studies

26 hod., optionally

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.

Project

13 hod., compulsory

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.

Syllabus

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