Synchronizing word
（重定向自Synchronizing sequence）
![This drawing represents a DFA with eight states and two input symbols, red and blue. The word blue-red-red-blue-red-red-blue-red-red is a synchronizing word that sends all states to the yellow state; the word blue-blue-red-blue-blue-red-blue-blue-red is another synchronizing word that sends all states to the green state.](/Images/godic/202502/14/Road_coloring_conjecture.svg1034.png")
In computer science, more precisely, in the theory of deterministic finite automata (DFA), a synchronizing word or reset sequence is a word in the input alphabet of the DFA which sends any state of the DFA to one and the same state. That is, if an ensemble of copies of the DFA are each started in different states, and all of the copies process the synchronizing word at the same speed, they will all end up reaching the same state as each other, at the same time as each other. Not every DFA has a synchronizing word; for instance, a DFA with two states, one for words of even length and one for words of odd length, can never be synchronized.