10 citations · 79 across the 27 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2021
Extremal Binary PFAs with Small Number of States
Stijn Cambie, Michiel de Bondt, Henk Don
The largest known reset thresholds for DFAs are equal to , where is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition…
cs.FL2018
A short and elegant proof of a theorem of J.-E. Pin
Michiel de Bondt
We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis. The part of the proof which is my own (not Pin's) is a complete replacement o…
cs.FL2018
Lower Bounds for Synchronizing Word Lengths in Partial Automata
Michiel de Bondt, Henk Don, Hans Zantema
It was conjectured by Černý in 1964, that a synchronizing DFA on states always has a synchronizing word of length at most , and he gave a sequence of DFAs for which th…