Regulated Grammars and Automata
RGD Acad. year 2020/2021 Winter semester
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):
- Regulated automata a grammars: basic idea.
- Grammars with regulated use of rules.
- Grammars with context-based regulation.
- Regulated grammars based on algebraic restrictions.
- Reduction of regulated grammars.
- Parallel versions of regulated grammars.
- Regulated finite automata.
- Regulated pushdown automata.
- Deep pushdown automata.
- Jumping automata.
Language of instruction
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.
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 kwnowledge and skills
- MEDUNA Alexander and ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9
- MEDUNA Alexander and SOUKUP Ondřej. Modern Language Models and Computation: Theory with Applications. New York: Springer US, 2017. ISBN 978-3-319-63099-1
- many very recent papers, scientific reports, and books
Syllabus of lectures
- Regulated Formal Models: An Introduction and Basic Ideas.
- Context-Based and Rule-Based Grammatical Regulation.
- Regulated Grammars: Transformations, Normal Forms, Erasing, Derivation Restrictions.
- Extension of Languages Resulting from Regulated Grammars.
- Grammatical Regulation Based on Algebraic Restrictions.
- Semi-Parallel and Totally Parallel Regulated Grammars.
- Regulated Grammar Systems.
- Multigenerative Grammar Systems.
- Regulated Automata: Basic Ideas.
- Automata Regulated by Control Languages.
- Jumping Finite Automata.
- Deep Pushdown Automata.
- Application Perspectives; summary.
Syllabus - others, projects and individual work of students
Two essays about regulated rewriting.
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