The Cerny conjecture and (n-1)-Hamiltonian automata. - Henk Don (CoRR, 2015)

New methods to bound the critical probability in fractal percolation. - Henk Don (Random Struct. Algorithms, 2015)

The Černý Conjecture and 1-Contracting Automata. - Henk Don (Electron. J. Comb., 2016)

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

Finding DFAs with Maximal Shortest Synchronizing Word Length. - Henk Don; Hans Zantema (LATA, 2017)

Synchronizing Non-Deterministic Finite Automata. - Henk Don; Hans Zantema (J. Autom. Lang. Comb., 2018)

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

Counting Symbol Switches in Synchronizing Automata. - Henk Don; Hans Zantema (J. Autom. Lang. Comb., 2019)

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)

Constructing Morphisms for Arithmetic Subsequences of Fibonacci. - Wieb Bosma; Henk Don (Logics and Type Systems in Theory and Practice, 2024)