Regular languages are formal languages that can be defined by a regular expression or recognized by a finite automaton. They are equivalent to Type-3 grammars and are recognized by Kleene's theorem.

A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.