Course details

Modern Theoretical Computer Science

TID Acad. year 2017/2018 Winter semester

Current academic year

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.

Guarantor

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

Language of instruction

Czech, English

Completion

Examination (oral)

Assessment points

  • 60 pts final exam (written part)
  • 40 pts projects

Department

Department of Information Systems (UIFS)

Subject specific learning outcomes and competences

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

Learning objectives

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.

Prerequisite knowledge and skills

formal languages

Study literature

  • 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

Fundamental literature

  • 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

Syllabus of seminars

Syllabus of lectures:
  • 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.

Syllabus - others, projects and individual work of students:
  • An essay based on selected scientific studies dealing with the teoretical computer science area related to the student's dissertation

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Controlled instruction

1. Paper during the semester:

  • 40 points = 30 for essay + 10 for presentation.
  • The topic has to be related to the topic of the course, approved by both guarantee (Prof. Meduna) and the supervisor.
  • 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 sening 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.

Course inclusion in study plans

  • Programme VTI-DR-4, field DVI4, any year of study, Elective
Back to top