Experiments with Synchronizing Automata [chapter]

Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła
2016 Lecture Notes in Computer Science  
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing the results. In particular, we have verified the Černý conjecture for all binary automata with at most
more » ... states, and all ternary automata with at most 8 states.
doi:10.1007/978-3-319-40946-7_15 fatcat:w4tqaniirzeb3bwy3lt2uficwa