Lecture Slides

NoTopicDateSlides
A1Organizational Matters21.2.screen
print4
print1
A2Mathematical Foundations21.2.screen
print4
print1
A3Proof Techniques23.2.screen
print4
print1
B1Finite Automata28.2.screen
print4
print1
B2Grammars14.3.screen
print4
print1
B3Regular Languages16.3.screen
print4
print1
B4Regular Languages: Closure & Decidability21.3.screen
print4
print1
B5Regular Languages: Regular Expressions23.3.screen
print4
print1
B6Regular Languages: Pumping Lemma30.3.screen
print4
print1
B7Context-free Languages: epsilon-Rules and Chomsky Normal Form4.4.screen
print4
print1
B8Context-free Languages: PDAs4.4.screen
print4
print1
B9Context-free Languages: Closure & Decidability6.4.screen
print4
print1
B10Turing Machines I11.4.screen
print4
print1
B11Turing Machines II13.4.screen
print4
print1
B12Type-1 and Type-0 Languages: Closure & Decidability20.4.screen
print4
print1
C1Turing Machines as Formal Model of Computation25.4.screen
print4
print1
C2The Halting Problem25.4.screen
print4
print1
C3Turing-Computability2.5.screen
print4
print1
C4Reductions4.5.screen
print4
print1
C5Rice's Theorem9.5.screen
print4
print1
D1Nondeterministic  Algorithms, P and NP11.5.screen
print4
print1
D2Polynomial Reductions and NP-completeness16.5.screen
print4
print1
D3Proving NP-Completeness18.5.screen
print4
print1
D4NP-complete Problems I23.5.screen
print4
print1