Theoretical computer science is, as the name suggests, a highly abstract subfield of computer science. The exercises in this book provide students with easier access to the multifaceted topic of "automata and formal languages." This is because "stagnant," highly theoretical knowledge is often mastered only through practical application. This practical workbook contains 117 tasks on the following topics: - finite automata - grammars - pushdown automata - regular expressions and regular languages. All exercises in this book are designed to test and deepen the theoretical content. The problem statements and solutions are presented step by step and illustrated with many figures. All solutions are elaborately worked out and demonstrate easily understandable pathways to the answers.