This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Representation of Sequential Machines for Determining All Incompatible Pairs
March 1974 (vol. 23 no. 3)
pp. 325-326
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.
Index Terms:
d ? A, implied pairs, incompatible pairs sequential machine, state table.
Citation:
null Sureshchander, P.C.P. Bhatt, "A New Representation of Sequential Machines for Determining All Incompatible Pairs," IEEE Transactions on Computers, vol. 23, no. 3, pp. 325-326, March 1974, doi:10.1109/T-C.1974.223930
Usage of this product signifies your acceptance of the Terms of Use.