The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1974 vol.23)
pp: 325-326
null Sureshchander , Computer Centre, Indian Institute of Technology
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.
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
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool