LFU:online

In-depth understanding in the field of finite automata and logic; students have a full command of the concepts and theoretical tools underlying computational verification and can also develop these independently if necessary.

Discussion, deepening and practicing the contents of the lecture; 

(deterministic, non-deterministic, alternating) finite automata; regular expressions; (weak) monadic second-order logic; Presburger arithmetic; (alternating) Büchi automata; linear-time temporal logic; tree automata

Weekly exercises that are presented and discussed in the proseminar

Continuous assessment of course work

Slides as well as solutions to selected exercises will be made available online.