9 citations · 40 across the 22 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 2 cited
Synchronizing non-deterministic finite automata
Henk Don, Hans Zantema
In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that Černý's conjecture generalizes to CNF…
math.CO2017★ 2 cited
DFAs and PFAs with Long Shortest Synchronizing Word Length
Michiel de Bondt, Henk Don, Hans Zantema
It was conjectured by Černý in 1964, that a synchronizing DFA on states always has a shortest synchronizing word of length at most , and he gave a sequence of DFAs for…