Title:  Modern Theoretical Computer Science 

Code:  TID 

Ac.Year:  2017/2018 

Term:  Winter 

Curriculums:  

Language:  Czech 

Public info:  http://www.fit.vutbr.cz/study/courses/TID/public/ 

Completion:  examination (verbal) 

Type of instruction:  Hour/sem  Lectures  Sem. Exercises  Lab. exercises  Comp. exercises  Other 

Hours:  39  0  0  0  13 

 Examination  Tests  Exercises  Laboratories  Other 

Points:  60  0  0  0  40 



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:  

Schedule:  Day  Lesson  Week  Room  Start  End  Lect.Gr.  St.G.  EndG. 

Thu  lecture  lectures  A113  11:00  13:50  1DVI   



Learning objectives: 

  To give an indepth 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.
 Randomcontext grammars.
 Left versions of regulated grammars.
 Hierarchy of Language Families Resulting from Regulated Grammars.
 CD Grammar Systems.
 PC Grammar Systems.
 L systems.
 Semiparallel formal models; multigrammars.
 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, AddisonWesley, 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, AddisonWesley, 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 "TIDpaper". 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 resubmit. 2. Oral exam consists of two questions, 30 points each. 
