Modern Theoretical Computer Science

Public info:http://www.fit.vutbr.cz/study/courses/TID/public/
Completion:examination (verbal)
Type of
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Guarantee:Meduna Alexander, prof. RNDr., CSc., DIFS
Lecturer:Masopust Tomáš, RNDr., Ph.D., DIFS
Meduna Alexander, prof. RNDr., CSc., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Compiler Construction (VYPe), DIFS
Learning objectives:
  In-depth overview of modern theoretical computer science.
  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.
Knowledge and skills required for the course:
  formal languages
Learning outcomes and competences:
  Thorough grasp of concepts and results achieved in modern theoretical computer science.
Syllabus of lectures:
  • Introduction.
  • Pure formal models.
  • Regulated formal models; matrix and programmed rewriting.
  • Parallel formal models; L systems; semi-parallel formal models; scattered rewriting.
  • Universal formal systems; selective rewriting; grammar systems.
  • Formal models for natural languages.
  • Algbraic approach to automata; relations and translations.
  • Algbraic approach to formal languages; free monoids.
  • More on the relationship between mathematics and computer science; graphs, categories.
  • New approach to complexity and computability.
  • Theoretical computer science and philosophy; Russell, Wittgenstein, Godel, Carnap, Husserl, Marcel, Heidegger.
  • Crucial trends introduced during the last decade.
  • Expected future 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
Fundamental literature:
  • John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
  • many very recent papers, scientific reports and books
Study literature:
  • copy of lectures
  • Meduna, A.: Automata and Languages. London, Springer, 2000
  • John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
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 masopust@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.