Course detail
Modern Theoretical Computer Science
FIT-TIDAcad. year: 2021/2022
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):
- Normal Forms for General Grammars.
- Regulated Grammars.
- Matrix Grammars.
- Programmed Rewriting.
- Random Context Grammars.
- CD Grammar Systems.
- PC Grammar Systems.
- L Systems.
- Scattered Context Grammars.
- Transducers.
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).
- The paper has to be submitted by Monday of the week of presentation. Send it by email to meduna@fit.vutbr.cz, with a subject "TID-paper". Attention! If the paper is sent on Tuesday of the week of presentation, loss of 5 points follows. Any later sending will be discussed individually.
- After the presentation, the paper can be improved and re-submit.
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
MEDUNA Alexander a TECHET Jiří. Scattered Context Grammars and their Applications. WIT Press, UK, 2010. ISBN 978-1-84564-426-0
MEDUNA Alexander a ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9
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 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
- Programme IT-DR-1H Doctoral
branch DRH , 0 year of study, winter semester, elective
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- Introduction.
- Regulated formal models: principles.
- Matrix grammars.
- Parallel grammars.
- Random-context grammars.
- Left versions of regulated grammars.
- Hierarchy of Language Families Resulting from Regulated Grammars.
- CD Grammar Systems.
- PC Grammar Systems.
- L systems.
- Semi-parallel formal models; multi-grammars.
- Scattered context grammars.
- New versions of classical automata.
- Current trends; summary.
Project
Teacher / Lecturer
Syllabus
Guided consultation in combined form of studies
Teacher / Lecturer