Given two disjoint deterministic finite automata (DFAs) G and H, there exists a common word that synchronizes G to a prescribed state u and H to a prescribed state v.
