Course details

Regulated Grammars and Automata

RGD Acad. year 2022/2023 Winter semester

Current academic year

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.

Guarantor

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

Course coordinator

Křivka Zbyněk, Ing., Ph.D. (DIFS)

Language of instruction

Czech, English

Completion

Examination (oral)

Time span

  • 39 hrs lectures
  • 13 hrs projects

Assessment points

  • 60 pts final exam
  • 40 pts projects

Department

Department of Information Systems (UIFS)

Lecturer

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

Instructor

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

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 regulated rewriting in formal language theory and its applications.

Learning objectives

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.

Prerequisite knowledge and skills

formal languages

Study literature

Syllabus of lectures

  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.

Syllabus - others, projects and individual work of students

Two essays about regulated rewriting.

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

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

Course inclusion in study plans

Back to top