Solving Mahjong Solitaire boards with peeking - Michiel de Bondt (CoRR, 2012)

The computational complexity of Minesweeper - Michiel de Bondt (CoRR, 2012)

DFAs and PFAs with Long Shortest Synchronizing Word Length. - Michiel de Bondt; Henk Don; Hans Zantema (DLT, 2017)

Fast algorithms for anti-distance matrices as a generalization of Boolean matrices. - Michiel de Bondt (CoRR, 2017)

Subset synchronization of DFAs and PFAs, and some other results. - Michiel de Bondt (CoRR, 2018)

A short proof of a theorem of J.-E. Pin. - Michiel de Bondt (CoRR, 2018)

Slowly synchronizing DFAs of 7 states and maximal slowly synchronizing DFAs. - Michiel de Bondt (CoRR, 2019)

Lower Bounds for Synchronizing Word Lengths in Partial Automata. - Michiel de Bondt; Henk Don; Hans Zantema (Int. J. Found. Comput. Sci., 2019)

Solving Shisen-Sho boards. - Michiel de Bondt (CoRR, 2020)

Extremal Binary PFAs in a Černý Family. - Stijn Cambie; Michiel de Bondt; Henk Don (DLT, 2021)

Slowly synchronizing automata with fixed alphabet size. - Henk Don; Hans Zantema; Michiel de Bondt (Inf. Comput., 2021)

Extremal Binary PFAs with Small Number of States. - Stijn Cambie; Michiel de Bondt; Henk Don (Int. J. Found. Comput. Sci., 2023)