A Note on Internal State Minimization in Incompletely Specified Sequential Networks

Abstract

A step in state minimization requires the selection of a minimal class of compatible sets of internal states which covers the given machine and is closed. Grasselli and Luccio have presented a solution of this problem which has certain drawbacks. This paper presents a simpler and shorter algorithm, guaranteed to yield all solutions, based upon their work and that of Paull and Unger.