A New Representation of Sequential Machines for Determining All Incompatible Pairs
暂无分享,去创建一个
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.
[1] Ioan Tomescu. A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine , 1972, IEEE Transactions on Computers.
[2] M. P. Marcus. Derivation of Maximal Compatibles Using Boolean Algebra , 1964, IBM J. Res. Dev..
[3] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..