Geodesic
Slowly Synchronizing Automata with Zero and Uncovering Sets
Matematičeskie zametki, Tome 90 (2011) no. 3, pp. 422-430

Voir la notice de l'article provenant de la source Math-Net.Ru

Using the combinatorial properties of uncovering sets in a free monoid, we construct a series of finite deterministic synchronizing automata with zero for which the shortest synchronizing word has length $n^2/4+n/2-1$, where $n$ is the number of states.
Keywords: free monoid, uncovering set, deterministic and nondeterministic automaton, synchronizing automaton (with zero), synchronizing word
Mots-clés : maximal code. 
@article{MZM_2011_90_3_a7,
     author = {E. V. Pribavkina},
     title = {Slowly {Synchronizing} {Automata} with {Zero} and {Uncovering} {Sets}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {422--430},
     publisher = {mathdoc},
     volume = {90},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2011_90_3_a7/}
}
TY  - JOUR
AU  - E. V. Pribavkina
TI  - Slowly Synchronizing Automata with Zero and Uncovering Sets
JO  - Matematičeskie zametki
PY  - 2011
SP  - 422
EP  - 430
VL  - 90
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2011_90_3_a7/
LA  - ru
ID  - MZM_2011_90_3_a7
ER  - 
%0 Journal Article
%A E. V. Pribavkina
%T Slowly Synchronizing Automata with Zero and Uncovering Sets
%J Matematičeskie zametki
%D 2011
%P 422-430
%V 90
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2011_90_3_a7/
%G ru
%F MZM_2011_90_3_a7
E. V. Pribavkina. Slowly Synchronizing Automata with Zero and Uncovering Sets. Matematičeskie zametki, Tome 90 (2011) no. 3, pp. 422-430. http://geodesic.mathdoc.fr/item/MZM_2011_90_3_a7/