Grundkurs Theoretische Informatik

Theoretical computer science - the lecture companion. Computability, formal languages, algorithms and complexity theory are theoretical topics with practical relevance, to which there are equally practical approaches. You can look forward to a modern didactic approach that links strictly formal topics with your intuition, elaborates them in a learner-friendly way, and finally presents fields of application in computer science for each topic. Stefan Neubert not only enjoys theoretical computer science himself, but is also passionately dedicated to teaching it at the beginning and in the course of the bachelor's degree. An introduction with many tasks and examples, also suitable for self-study.

From the contents:

Basic mathematical notation
Models and limits of computability
Formal languages: Finite automata, context-free grammars, pumping lemmas, and more
Proof methods for correctness and runtime of algorithms
Paradigms for algorithm design
Amortized analysis and lower bounds for runtimes
NP-completeness and reduction.