Finite automata and regular languages

Deterministic, nondeterministic, two-way and ε-automata, transducers, regular expressions and Kleene's theorem, closure properties of regular languages, automaton minimization, and the algebraic theory of recognition by monoids.

• Automata and regular expressions
• Automaton minimization
• Syntactic monoids and algebraic recognition

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.