The set of synchronizing words a given n-state automaton forms regular language recognizable by an with \(2^n - n\) states. size recognizing for the is linked to computational problems related synchronization and length words. Hence, it natural investigate automata extremal this property, i.e., such that minimal deterministic has sync-maximal permutation groups have been introduced in [S. Hoffm...