Let's play with deterministic automata

The theory of languages and automata belongs to the fundamental branch of computer science. In this teaching unit, we will study languages and their representation, in particular rational languages and their representation by finite state automata.

More specifically, we'll look at 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 equivalence with rational languages. We conclude with deterministic automaton minimization.