A Synthesis Technique for Minimal State Sequential Machines

A method is presented which always yields a minimal state sequential machine satisfying a prescribed finite set of input-output sequences. An application is made to the case where a given sequential machine is to be reduced, by the merging technique, to a machine having the smallest number of states possible. Numerous examples are given.