Factorable synthesis of Mealy–Moore sequential machines
L.G. McCracken · Electronics Letters · 1966
The Mealy–Moore sequential machines' factoring is extended to triad and quatrad iteration cycles. A chain of distinguishable machines with a contractive mapping property is considered, and simplification of the machine structure results when the output network can be decomposed. Identifying the chain of machines as an exact sequence over the input-state product space, one is led to the conclusion that the exact sequence affords easy description of physical processes, but not to a logical synthesis.