Issue No. 03 - March (1974 vol. 23)
null Sureshchander , Computer Centre, Indian Institute of Technology
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.
d ? A, implied pairs, incompatible pairs sequential machine, state table.
n. Sureshchander and P. Bhatt, "A New Representation of Sequential Machines for Determining All Incompatible Pairs," in IEEE Transactions on Computers, vol. 23, no. , pp. 325-326, 1974.