Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
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, Mathematics, Ural
TL;DR
This paper presents a new winning strategy for the Synchronizer in the synchronization game, applicable to a specific class of finite automata characterized by their transition monoid structure.
Contribution
It introduces a novel approach to the synchronization game by identifying automata with transition monoids where regular D-classes form subsemigroups, expanding understanding of synchronization strategies.
Findings
Winning strategy for Synchronizer established
Applicable to automata with specific monoid structure
Advances theoretical understanding of automaton synchronization
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.