Course detail

Modern Theoretical Computer Science

FIT-TIDAcad. year: 2019/2020

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.

Learning outcomes of the course unit

Thorough grasp of concepts and results achieved in modern theoretical computer science.

Prerequisites

Formal languages.

Co-requisites

Not applicable.

Recommended optional programme components

Not applicable.

Recommended or required reading

Kopie přednášek
Meduna, A.: Automata and Languages. London, Springer, 2000
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory, Boston, Addison-Wesley, 2001
mnoho nejnovějších článků, vědeckých zpráv a knih

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Not applicable.

Language of instruction

Czech, English

Work placements

Not applicable.

Aims

To give an in-depth overview of modern theoretical computer science. Most importantly, to present the latest research in the area of automata, formal languages, formal models, computability, complexity, and translation.

Specification of controlled education, way of implementation and compensation for absences

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).
  • 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.

Classification of course in study plans

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, 0 credits, optional

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, 0 credits, optional

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, 0 credits, optional

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, 0 credits, optional

Type of course unit

 

Lecture

39 hours, optionally

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.

Projects

13 hours, compulsory

Teacher / Lecturer

Syllabus


  • Two essays based on selected scientific studies dealing with the teoretical computer science area.

eLearning