Minimization of DFAs

Some students were wondering about minimization of DFAs, that is, given a DFA is it possible to find an equivalent DFA with a minimal number of states. This is, in fact, possible! For those who are interested, I recommend looking into the Myhill-Nerode theorem and, for example, Hopcroft's algorithm.

This is not exam relevant, just something to look into if you're interested.