Implicit prime compatible generation for minimizing incompletely specified finite state machines

This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. The proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM´s