D. S. Ananichev and M. V. Volkov, Some results o? Cern´yCern´y type problems for transformation semigroups, Semigroups and Languages, pp.23-42, 2004.

]. J. Cern´ycern´y, Poznamka k homogenym eksperimentom s konechnymi automatami

L. Dubuc, Sur le automates circulaires et la conjecture d? Cern´yCern´y
DOI : 10.1051/ita/1998321-300211

D. Eppstein, Reset Sequences for Monotonic Automata, SIAM Journal on Computing, vol.19, issue.3, pp.500-510, 1990.
DOI : 10.1137/0219033

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Kari, Synchronizing Finite Automata on Eulerian Digraphs, Lect. Notes in Comp. Sci, vol.2136, pp.432-438, 2001.
DOI : 10.1007/3-540-44683-4_38

URL : http://dx.doi.org/10.1016/s0304-3975(02)00405-x

A. A. Kljachko, I. K. Rystsov, and M. A. Spivak, An extremal combinatorial problem connected with the bound on the length of a recurrent word in an automata, Kybernetika, issue.2, pp.16-25, 1987.

J. Pin, Sur un cas particulier de la conjecture de Cerny, Lect. Notes Comp. Sci, vol.62, pp.345-352, 1978.
DOI : 10.1007/3-540-08860-1_25

URL : https://hal.archives-ouvertes.fr/hal-00340771

J. Pin, On two Combinatorial Problems Arising from Automata Theory, Ann. Discrete Math, vol.17, pp.535-548, 1983.
DOI : 10.1016/S0304-0208(08)73432-7

URL : https://hal.archives-ouvertes.fr/hal-00143937

I. K. Rystsov, Almost optimal bound of recurrent word length for regular automata, Cybernetics and Systems Analysis, vol.3, issue.5, pp.669-674, 1995.
DOI : 10.1007/BF02366314

I. K. Rystsov, Reset words for commutative and solvable automata, Theoretical Computer Science, vol.172, issue.1-2, pp.273-279, 1997.
DOI : 10.1016/S0304-3975(96)00136-3

URL : http://doi.org/10.1016/s0304-3975(96)00136-3

A. Salomaa, Generation of constants and synchronization of finite automata, J. Univers. Comput. Sci, vol.8, pp.332-347, 2002.

M. P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.190-194, 1965.
DOI : 10.1016/S0019-9958(65)90108-7