16.1 Minimal DFA. Show that a minimal DFA A also has the minimal number of transitions among all other DFAs equivalent to A. Prove that a language L is regular i Q = fSuL(u) : u 2 g is nite. Show that the number of states of a minimal DFA A with L(A) = L is precisely the cardinality of Q.