Issue No. 04 - April (1972 vol. 21)
Gabriele Saucier , Laboratory of Applied Mathematics, University of Grenoble, Grenoble, France.
A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis. A first illustration is given by Liu's encoding; likewise, Tracey's selection theorems are easily found again and placed in a more general context.
G. Saucier, "Next-State Equations of Asynchronous Sequential Machines," in IEEE Transactions on Computers, vol. 21, no. , pp. 397-399, 1972.