Henk Don

Int. J. Found. Comput. Sci., 2023

2021

Slowly synchronizing automata with fixed alphabet size.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Extremal Binary PFAs in a Černý Family.

[BibT_eX]

[DOI]

Stijn Cambie

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2019

Counting Symbol Switches in Synchronizing Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2019

Lower Bounds for Synchronizing Word Lengths in Partial Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

2018

Synchronizing Non-Deterministic Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

2017

Finding DFAs with Maximal Shortest Synchronizing Word Length.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

DFAs and PFAs with Long Shortest Synchronizing Word Length.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

The Černý Conjecture and 1-Contracting Automata.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

New methods to bound the critical probability in fractal percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

The Cerny conjecture and (n-1)-Hamiltonian automata.

[BibT_eX]

[DOI]