On Realizations of Synchronous Sequential Machines

In this correspondence it is shown that by applying Gavrilov's test algorithm to any Boolean function numerically represented by its "constrained designation numbers", introduced by Ledley, a very suitable program for the automatic determination of the prime implicants and of the prime implicant table can be established.