Lectures will be in English.
A basic course in theoretical computer science with an introduction to finite automata (Einführung in die theoretische Informatik, Module IN0011)
The course introduces the basic theory of finite automata on finite and infinite words. It presents automata as data structures for representing and manipulating sets. Topics include constructions for boolean operations, minimization, transducers, decision diagrams, relation to logic, and applicatins to pattern matching and verification.