Generation of Internal State Assignments for Large Asynchronous Sequential Machines
Robert J. Smith · IEEE Transactions on Computers · 1974
Several algorithms have been proposed for generating satisfactory state assignments for normal fundamental mode asynchronous sequential circuits. Programmed versions of minimal and near-minimal techniques have been incorporated in automated synthesis systems, but are known to require computational efforts which increase exponentially with flow table size. Other methods, requiring much less effort, produce assignments with far more state variables than minimal assigments.