The triple rendezvous time of a synchronizing automaton can be floor(4n/3)

Enkai Zhang

For every $n\ge 9$, we construct a strongly connected synchronizing automaton with two input letters and $n$ states whose shortest word merging some three distinct states has length…