On the Minimization of the Number of Internal States in Incompletely Specified Sequential Machines

Abstract

The algorithm of a systematic minimization method givrn in this paper uses tree idea for generating all compatibility classes and uses Meisel's tree display to produce all possible minimal solutions of a given incompletely specified sequential machine. An example is given for illustration.