A Simple Proof of a Theorem on Self-synchronizing Automata.

A short proof is offered for verifying that a finite state, completely specified automation is synchronized with probability 1 only if there exists a universal synchronizer for the automation. 7 pp....