The Černý conjecture and 1-contracting automata
The electronic journal of combinatorics, Tome 23 (2016) no. 3
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. Černý conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of length at most $(n-1)^2$. We introduce the notion of aperiodically 1-contracting automata and prove that in these automata all subsets of the state set are reachable, so that in particular they are synchronizing. Furthermore, we give a sufficient condition under which the Černý conjecture holds for aperiodically 1-contracting automata. As a special case, we prove some results for circular automata.
DOI :
10.37236/5616
Classification :
68Q45
Mots-clés : deterministic finite automaton, synchronizing word
Mots-clés : deterministic finite automaton, synchronizing word
Affiliations des auteurs :
Henk Don  1
@article{10_37236_5616,
author = {Henk Don},
title = {The {\v{C}ern\'y} conjecture and 1-contracting automata},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {3},
doi = {10.37236/5616},
zbl = {1350.68167},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5616/}
}
Henk Don. The Černý conjecture and 1-contracting automata. The electronic journal of combinatorics, Tome 23 (2016) no. 3. doi: 10.37236/5616
Cité par Sources :