Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
<|reference_start|>Winning Strategies for the Synchronization Game on Subclasses of Finite Automata: We exhibit a winning strategy for Synchronizer in the synchronization game on every synchronizing automaton in whose transition monoid the regular D-classes form subsemigroups<|reference_end|>
@article{fernau2024winning,
    title={Winning Strategies for the Synchronization Game on Subclasses of Finite
  Automata},
    author={Henning Fernau (Universit"at Trier, Fachbereich IV,
  Informatikwissenschaften, Trier, Germany), Carolina Haase (Universit"at
  Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany), Stefan
  Hoffmann, Mikhail Volkov (Institute of Natural Sciences and Mathematics, Ural
  Federal University, Ekaterinburg, Russia)},
    journal={EPTCS 407, 2024, pp. 77-85},
    year={2024},
    doi={10.4204/EPTCS.407.6},
    archivePrefix={arXiv},
    eprint={2409.06971},
    primaryClass={cs.FL cs.GT}
}