10 citations · 69 across the 22 of their papers we have counts for
31 papers
A camel with a less strict diet
Michiel de Bondt
A camel can carry bananas on its back. It can have bananas at a time in its stomach. For each mile the camel walks, the amount of bananas in its stomach decreases . As s…
The Camel-Banana Problem
Michiel de Bondt
A camel can carry one banana at a time on its back. It is on a diet and therefore can only have one banana at a time in its stomach. As soon as it has eaten a banana it walks a mil…
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…
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…
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…
The classification of some polynomial maps with nilpotent Jacobians
Dan Yan, Michiel de Bondt
In the paper, we first classify all polynomial maps of the following form: with nilpote…