A SIMPLE PROOF OF A THEOREM ON SELF-SYNCHRONIZING AUTOMATA.
RAND CORP SANTA MONICA CA
Pagination or Media Count:
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. Author
- Operations Research