A new algorithm for the reduction of incompletely specified finite state machines
Jorge Martínez Peña, Arlindo L. Oliveira · 1998
We propose a new rdgorithm to the problem of state reduction in incompletely specified finite state machines.~is algorithm is not based on the enumeration of compatible sets, and, therefore, its performance is not dependent on the number of prime compatibles.We prove that the algorithm is exact and present results that show that, in a set of hard problems, it is much more efficient than both the explicit and implicit approaches based on the enumeration of compatible sets.