Course detail

Modern Theoretical Computer Science

FIT-TIDAcad. year: 2020/2021

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

    Czech

    Mode of study

    Not applicable.

    Guarantor

    prof. RNDr. Alexandr Meduna, CSc.

    Department

    Department of Information Systems (UIFS)

    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.

    Planned learning activities and teaching methods

    Not applicable.

    Assesment methods and criteria linked to learning outcomes

    Not applicable.

    Course curriculum

    Not applicable.

    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.

    Recommended optional programme components

    Not applicable.

    Prerequisites and corequisites

    Not applicable.

    Basic literature

    Not applicable.

    Recommended reading

    Copy of lectures
    HOPCROFT John E., MOTWANI Rajeev, ULLMAN Jeffrey D. Introduction to Automata Theory, Languages, and Computation (3rd ed.). Pearson, 2013. ISBN 978-1-2920-3905-3
    many very recent papers, scientific reports, and books
    MEDUNA Alexander and TECHET Jiří. Scattered Context Grammars and their Applications. WIT Press, UK, 2010. ISBN 978-1-84564-426-0
    MEDUNA Alexander and 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

    Classification of course in study plans

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

    39 hod., optionally

    Teacher / Lecturer

    prof. RNDr. Alexandr Meduna, CSc.

    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

    13 hod., compulsory

    Teacher / Lecturer

    Ing. Zbyněk Křivka, Ph.D.

    Syllabus

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

    Guided consultation in combined form of studies

    26 hod., optionally

    Teacher / Lecturer

    prof. RNDr. Alexandr Meduna, CSc.