Title:

Modern Theoretical Computer Science

Code:TID
Ac.Year:2017/2018
Term:Winter
Curriculums:
ProgrammeBranchYearDuty
CSE-PHD-4DVI4-Elective
Language:Czech
Public info:http://www.fit.vutbr.cz/study/courses/TID/public/
Completion:examination (verbal)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900013
 ExaminationTestsExercisesLaboratoriesOther
Points:6000040
Guarantee:Meduna Alexander, prof. RNDr., CSc., DIFS
Lecturer:Meduna Alexander, prof. RNDr., CSc., DIFS
Instructor:Křivka Zbyněk, Ing., Ph.D., DIFS
Soukup Ondřej, Ing., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Compiler Construction (VYPa), DIFS
Schedule:
DayLessonWeekRoomStartEndLect.Gr.St.G.EndG.
ThulecturelecturesA11311:0013:501DVI
 
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.
Description:
  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.
  • 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
Fundamental literature:
 
  • John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata 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 Automata 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 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.