Finite Automaton

Participation

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

Lecture slides

A1Organizational Matters16.2.screen
print4
print1
A2Mathematical Foundations16.2.screen
print4
print1
A3Proof Techniques18.2.screen
print4
print1
B1Formal Languages & Grammars2.3.screen
print4
print1
B2Regular Grammars: ε-Rules4.3.screen
print4
print1
B3Finite Automata4./9.3.screen
print4
print1
B4Finite Automata: Characterization9.3.screen
print4
print1
B5Regular Languages: Closure Properties and Decidability11.3.screen
print4
print1
B6Regular Languages: Regular Expressions16.3.screen
print4
print1
B7Regular Languages: Pumping Lemma18.3.screen
print4
print1
B8Context-free Languages: ε-Rules & Chomsky Normal Form23.3.screen
print4
print1
B9Context-free Languages: Push-Down Automata25.3.screen
print4
print1
B10Context-free Languages: Closure & Decidability30.3.screen
print4
print1
B11Turing Machines I30.3./01.04screen
print4
print1
B12Turing Machines II01.04screen
print4
print1
B13Type-1 and Type-0 Languages: Closure & Decidability08.04screen
print4
print1
C1Turing Machines as Formal Model of Computation08./13.04screen
print4
print1
C2The Halting Problem13.04screen
print4
print1
C3Turing-Computability15.04screen
print4
print1
C4Reductions20.04screen
print4
print1
C5Post Correspondence Problem20./22.04.screen
print4
print1
C6Rice’s Theorem22./27..4.screen
print4
print1
D1Nondeterministic Algorithms, P and NP27.4.screen
print4
print1
D2Polynomial Reductions and NP-completeness29.4.screen
print4
print1
D3Proving NP-Completeness4.5.screen
print4
print1
D4Some NP-Complete Problems, Part I6.5.screen
print4
print1
D5Some NP-Complete Problems, Part II11.5.screen
print4
print1
D6Beyond NP13.5.screen
print4
print1
Nach oben