Title :
A New Representation of Sequential Machines for Determining All Incompatible Pairs
Author :
Sureshchander ; Bhatt, P.C.P.
Author_Institution :
Computer Centre, Indian Institute of Technology
fDate :
3/1/1974 12:00:00 AM
Abstract :
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.
Keywords :
δ ↾ A, implied pairs, incompatible pairs sequential machine, state table.; Agriculture; Tin; δ ↾ A, implied pairs, incompatible pairs sequential machine, state table.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1974.223930
