On a Method of Solving the Problem of Synchronizing a Chain of Automata in Minimal Time

A description is given of an extremely simple system of signals between automata yielding a minimal-time solution of the problem of synchronizing a chain of automata in which each automaton has in one variant 12 and in another 9 states. The principle is illustrated in color in Table 1. In the known minimal-time solutions of the synchronization problem for a chain of automata each automaton has many thousands of states.