activity
20232026
most citedList of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata

1 citations · 2 across the 7 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.FL2026

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…

cs.FL2026★ 1 cited

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…