Synchronization of some DFA

@inproceedings{Trahtman2007SynchronizationOS,
  title={Synchronization of some DFA},
  author={Avraham N. Trahtman},
  year={2007}
}
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. Černy conjectured in 1964 that every nstate synchronizable automaton possesses a synchronizing word of length at most (n − 1). The problem is still open. It will be proved that the minimal… CONTINUE READING