Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
Formal Languages and Automata Theory
2024-09-12 v1 Computer Science and Game Theory
Abstract
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
Cite
@article{arxiv.2409.06971,
title = {Winning Strategies for the Synchronization Game on Subclasses of Finite Automata},
author = {Henning Fernau and Carolina Haase and Stefan Hoffmann and Mikhail Volkov},
journal= {arXiv preprint arXiv:2409.06971},
year = {2024}
}
Comments
In Proceedings NCMA 2024, arXiv:2409.06120