Finite Automaton

Participation

Please register for the course to gain access to the Adam workspace.

Lecture slides

A1Organizational Matters19.2.screen
print4
print1
A2Mathematical Foundations19.2.screen
print4
print1
A3Proof Techniques24.2.screen
print4
print1
B1Formal Languages & Grammars26.2.screen
print4
print1
B2Regular Grammars: ε-Rules3.3.screen
print4
print1
B3Finite Automata3.3./
5.3
screen
print4
print1
B4Finite Automata: Characterization5.3.screen
print4
print1
B5Regular Languages: Closure Properties and Decidability17.3.screen
print4
print1
B6Regular Languages: Regular Expressions29.3.screen
print4
print1
B7Regular Languages: Pumping Lemma24.3.screen
print4
print1
B8Context-free Languages: ε-Rules & Chomsky Normal Form26.3.screen
print4
print1
B9Context-free Languages: Push-Down Automata31.3.screen
print4
print1
B10Context-free Languages: Closure & Decidability2.4.screen
print4
print1
B11Turing Machines I2.4.
7.4.
screen
print4
print1
B12Turing Machines II7.4
9.4.
screen
print4
print1
B13Type-1 and Type-0 Languages: Closure & Decidability9.4.screen
print4
print1
C1Turing Machines as Formal Model of Computation9.4.
14.4.
screen
print4
print1
C2The Halting Problem14.4.
 
screen
print4
print1
C3Turing-Computability16.4.
 
screen
print4
print1
C4Reductions23.4.screen
print4
print1
C5Post Correspondence Problem28.4.screen
print4
print1
C6Rice’s Theorem30.4.screen
print4
print1
D1Nondeterministic Algorithms, P and NP5.5.screen
print4
print1
D2Polynomial Reductions and NP-completeness7.5.screen
print4
print1
proof
D3Proving NP-Completeness12.5.screen
print4
print1
D4Some NP-Complete Problems, Part I14.5.screen
print4
print1
D5Some NP-Complete Problems, Part II19.5.screen
print4
print1
D6Beyond NP21.5.screen
print4
print1
To top