James A. Foster

This lecture used a series of overhead transparancies to present the theory behind DFA minimization, and to present the algorithm I use for that process. Here are those transparancies.
bullet Equivalence and equivalence classes
bullet Motivating example part one and two
bullet The algorithm
bullet Proofs that the algorithm works
bullet Classes don't get bigger
bullet One character lookahead works (cont'd)
bullet Termination
bullet An example
bullet Computing equivalence classes (cont'd)
bullet final minimal DFA
bullet Another example
bullet Part one, two
 

Last Updated 01/13/2003 15:56 -0800