Issue No. 10 - October (1973 vol. 22)
R.S. Kashef , Department of Electrical Engineering, University of Southern California
Critical races can be avoided in the binary encoding of asynchronous sequential machines by making use of general codes employing-multistep changes in secondary variables to accomplish transitions between states. The shortest length code of this type presently available is Huffman's internmeshed row set code, which encodes race-free any 2<sup>S</sup>O-row flow table with 2S<inf>o</inf>-1 bits. In
Asynchronous sequential machines, augmented parity check codes, general race-free codes, maximum distance partition.
R. Kashef and R. McGhee, "Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines," in IEEE Transactions on Computers, vol. 22, no. , pp. 891-896, 1973.