L25: Minimizing Finite State Machines

Published: Jan. 27, 2012, 8 a.m.

b'In this supplemental lecture we define what is meant by a minimized DFA, and introduce an efficient algorithm to minimize the number of states in a DFA for any regular language.'