1 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
Completely Reachable Road Coloring
Mikhail V. Volkov, Yinfeng Zhu
We characterize the digraphs that admit an edge labeling by letters from a finite alphabet such that the resulting labeled digraph is a completely reachable automaton. This class o…
Adversarial Synchronization
Anton E. Lipin, Mikhail V. Volkov
We study a variant of the synchronization game on finite deterministic automata. In this game, Alice chooses one input letter of an automaton on each of her moves while Bob may…
List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
Mikhail V. Volkov
We survey results in the literature that establish the Černý conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a qu…
Don's conjecture for binary completely reachable automata: an approach and its limitations
David Casas, Mikhail V. Volkov
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely re…