Uniform winning strategies for the synchronization games on subclasses of finite automata
By: Henning Fernau , Carolina Haase , Stefan Hoffmann and more
The pseudovariety $\mathbf{DS}$ consists of all finite monoids whose regular $D$-classes form subsemigroups. We exhibit a uniform winning strategy for Synchronizer in the synchronization game on every synchronizing automaton whose transition monoid lies in $\mathbf{DS}$, and we prove that $\mathbf{DS}$ is the largest pseudovariety with this property.
Similar Papers
Careful synchronisation and the diameter of transformation semigroups with few generators
Discrete Mathematics
Makes computers understand patterns much faster.
Computational Exploration of Finite Semigroupoids
Formal Languages and Automata Theory
Makes computers understand how to do tasks better.
Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
Formal Languages and Automata Theory
Makes computers solve hard problems faster.