Automata and regular expressions

DFA, NFA, ε-NFA and two-way automata, sequential transducers and Mealy and Moore machines, regular expressions, Thompson's construction and Kleene's theorem, star height, and closure of regular languages under homomorphism, quotient, shuffle and substitution.

• Closure properties of regular languages
• Finite languages
• Kleene's theorem
• Sequential transducers, Mealy and Moore machines
• Star height
• Thompson's construction
• Two-way finite automata

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.