A New Representation of Sequential Machines for Determining All Incompatible Pairs
Sureshchander, P.C.P. Bhatt · IEEE Transactions on Computers · 1974
In this correspondence a new representation of a sequential machine (without output) is given which enables the determination of all incompatible pairs without any intermediate step(s). The method is programmable, is much faster, and requires less memory than existing methods.