Let's Play with Deterministic Automata

The theory of languages and automata is a fundamental branch of computer science. In this course, we will study languages and their representations, with a particular focus on rational languages and their representation by finite-state automata.

More specifically, we will discuss languages, finite-state automata, the language recognized by an automaton, operations on automata and languages, non-deterministic automata, their determinization, regular expressions, regular languages, and their equivalence to rational languages. We will conclude with the minimization of deterministic automata.