Enkai Zhang

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

For every n >= 9 we construct a strongly connected synchronizing automaton with two letters and n states whose shortest word merging some three distinct states has length floor(4n/3). One letter is a permutation, and the other has rank n-1. Complete transition maps and three para...