4 citations · 16 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 3 cited
The Cerny conjecture and 1-contracting automata
Henk Don
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. Černý conjectured in 1964 that a synchronizing au…
math.PR2015
Crushing candies on the line
Henk Don
We investigate stability properties of a probabilistic cellular automaton based on the candy crush game.