Course detail
Regulated Grammars and Automata
FIT-RGDAcad. year: 2021/2022
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
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
- 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.
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
kopie přednášek
kopie přednášek (CS)
MEDUNA Alexander a SOUKUP Ondřej. Modern Language Models and Computation: Theory with Applications. New York: Springer US, 2017. ISBN 978-3-319-63099-1
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
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 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 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
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- 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.
Project
Teacher / Lecturer
Syllabus
Guided consultation in combined form of studies
Teacher / Lecturer