A combinatorial algorithm for minimizing the number of states of a deterministic finite automation
Nicholas J. De Lillo · Proceedings of the 17th conference on ACM Annual Computer Science Conference · 1989
In this paper, we present an algorithm for producing the specifications of an equivalent minimal-state deterministic finite automation over a given alphabet, given the specifications of some deterministic finite-state automation over the same alphabet. The algorithm has been designed to be converted into formal code, and has been used as a programming tool in developing applications software, particularly in the area of compiler construction.