We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and -synchronous for two different numbers and , then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.