|
Week
|
Topics
|
Study Metarials
|
|
1
|
Introduction, Evidence Methods
|
R1-Chapter-1
|
|
2
|
Finite Automats
|
R1-Chapter-2
|
|
3
|
Regular Expressions
|
R1-Chapter-2
|
|
4
|
Properties of Regular Languages
|
R1-Chapter-2
|
|
5
|
Decision Properties of Regular Languages
|
R1-Chapter-3
|
|
6
|
Context-Free Grammars and Uncertainty
|
R1-Chapter-3
|
|
7
|
Push Automats
|
R1-Chapter-3
|
|
8
|
Push Vending Machines and Context-Free Grammars
|
R1-Chapter-4
|
|
9
|
Operations on Context-Free Grammars
|
R1-Chapter-4
|
|
10
|
Closedness Properties of Context-Free Grammars
|
R1-Chapter-4
|
|
11
|
Turing Machines and Complexity
|
R1-Chapter-4
|
|
12
|
Different Turing Machine Models
|
R1-Chapter-5
|
|
13
|
Decided and Non-Decided Problems
|
R1-Chapter-5,6
|
|
14
|
NP-Complete Problems
|
R1-Chapter-6
|