2013/01/10 by Jakub Kowalski, Kowalski, Jakub, Marek Szykuła +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Machine Learning and Algorithms #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1301.2092
openalex publication_date 2013/01/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We present a report from a series of experiments involving computation of the shortest reset words for automata with small number of states. We confirm that the Černý conjecture is true for all automata with at most 11 states on 2 letters. Also some new interesting results were obtained, including the third gap in the distribution of the shortest reset words and new slowly synchronizing classes of automata.