11 citations · 29 across the 12 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.FL2014
Algebraic synchronization criterion and computing reset words
Mikhail Berlinkov, Marek Szykuła
We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of synchronizing automata. We express the condition that an automaton is synchronizing in terms…
cs.IT2014
On the Synchronization Rate for e-machines
Mikhail V. Berlinkov
It is known, that an -machine is either exactly or asymptotically synchronizing. In the exact case, the observer can infer the current machine state after observing generate…
cs.FL2014★ 2 cited
Testing for Synchronization
Mikhail V. Berlinkov
We consider the first problem that appears in any application of synchronizing automata, namely, the problem of deciding whether or not a given -state -letter automaton is sy…