Uniform winning strategies for the synchronization games on subclasses of finite automata
Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov

TL;DR
This paper demonstrates a uniform winning strategy for the synchronization game on automata with transition monoids in the pseudovariety DS, establishing it as the largest such class with this property.
Contribution
It introduces a uniform winning strategy for a class of automata and characterizes the maximal pseudovariety with this property.
Findings
A uniform winning strategy exists for automata with transition monoids in DS.
S is the largest pseudovariety with this synchronization property.
Abstract
The pseudovariety consists of all finite monoids whose regular -classes form subsemigroups. We exhibit a uniform winning strategy for Synchronizer in the synchronization game on every synchronizing automaton whose transition monoid lies in , and we prove that is the largest pseudovariety with this property.
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.
Taxonomy
Topicssemigroups and automata theory · Formal Methods in Verification · Advanced Algebra and Logic
