• About these notes ...

• Lecture 1 (Regular Languages and Monoids)

• Lecture 2 (Languages via Logical Formulae)

• Lecture 3 (MSO to Regular Languages)

• Lecture 4 (EF Games and First-order Definability)

• Lecture 5 (Schutzenberger's Theorem)

• Lecture 6 (Alternating Automata)

• Lecture 7 (Buchi Automata)

• Lecture 8 (Determinizing Buchi Automata)

• Lecture 9 (Buchi Games over Infinite Graphs)

• Lecture 10 (Complementation via Alternating Automata)

• Lecture 11 (Safra's Determinization Construction)

• Lecture 12 (Optimality of Safra's Construction and the Kupferman-Vardi Construction)

• Lecture 13 (From Streett Automata to Rabin Automata and Back)

• LTL and its Expressive Completeness (Slides)