Course detail

Regulated Grammars and Automata

FIT-RGDAcad. year: 2024/2025

This course discusses the regulated rewriting as an important topic in theoretical computer science during last years. It concentrates on the latest concepts and results in the area of regulated grammars and automata, including their application. The students will write a report about regulated rewriting in relation to their own research.

Topics for the state doctoral exam (SDZ):

  1. Regulated automata a grammars: basic idea.
  2. Grammars with regulated use of rules.
  3. Grammars with context-based regulation.
  4. Regulated grammars based on algebraic restrictions.
  5. Reduction of regulated grammars.
  6. Parallel versions of regulated grammars.
  7. Regulated finite automata.
  8. Regulated pushdown automata.
  9. Deep pushdown automata.
  10. Jumping automata.

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. 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).
  • After the presentation, the paper can be improved and re-submitted.

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

Aims

Students will obtain an in-depth overview of models and results concerning regulated rewriting in modern theoretical computer science. Most importantly, they will  improve their ability to use these theoretical knowledge in their own research.
Thorough grasp of concepts and results achieved in regulated rewriting in formal language theory and its applications.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

copies of lectures (EN)
kopie přednášek (CS)
ROZENBERG Grzegorz a SALOMAA Arto. Handbook of Formal Languages, Volumes 1-3. Springer, 1997

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 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. Regulated Formal Models: An Introduction and Basic Ideas.
  2. Context-Based and Rule-Based Grammatical Regulation.
  3. Regulated Grammars: Transformations, Normal Forms, Erasing, Derivation Restrictions.
  4. Extension of Languages Resulting from Regulated Grammars.
  5. Grammatical Regulation Based on Algebraic Restrictions.
  6. Semi-Parallel and Totally Parallel Regulated Grammars.
  7. Regulated Grammar Systems.
  8. Multigenerative Grammar Systems.
  9. Regulated Automata: Basic Ideas.
  10. Automata Regulated by Control Languages.
  11. Jumping Finite Automata.
  12. Deep Pushdown Automata.
  13. Application Perspectives; 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 about regulated rewriting.