11 citations · 29 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.FL2012
The Cerny Conjecture
Mikhail Berlinkov
The Černý conjecture (Černý, 1964) states that each n-state \san\ possess a \sw\ of length . From the other side the best upper bound for the \rl\ of n-state \sa\ known so…
cs.FL2012
Synchronizing Automata on Quasi Eulerian Digraph
Mikhail V. Berlinkov
In 1964 Černý conjectured that each -state synchronizing automaton posesses a reset word of length at most . From the other side the best known upper bound on the reset…