Winning Strategies for the Synchronization Game on Subclasses of Finite Automata

Henning Fernau
(Universität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany)
Carolina Haase
(Universität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany)
Stefan Hoffmann
Mikhail Volkov
(Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia)

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

In Florin Manea and Giovanni Pighizzini: Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), Göttingen, Germany, 12-13 August 2024, Electronic Proceedings in Theoretical Computer Science 407, pp. 77–85.
Published: 11th September 2024.

ArXived at: https://dx.doi.org/10.4204/EPTCS.407.6 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org