V. Blondel, R. M. Jungers, and A. Olshevsky, On primitivity of sets of matrices. ArXiv preprint, Cern´yCern´y. Poznámka k homogénnym eksperimentom s kone?n´kone?n´ymi automatami. Matematicko-fysikalny Casopis SAV, pp.208-216, 1964.

F. Gonze and R. M. Jungers, On the synchronizing probability function and the triple rendezvous time for synchronzing automata. ArXiv preprint, 2014.

R. M. Jungers, The Synchronizing Probability Function of an Automaton, SIAM Journal on Discrete Mathematics, vol.26, issue.1, pp.177-192, 2012.
DOI : 10.1137/100816109

A. A. Klyachko, I. K. Rystsov, and S. M. , In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton, Cybernetics, vol.7, issue.No. 2, pp.16-20, 1987.
DOI : 10.1007/BF01071771

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

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

A. N. Trahtman, Modifying the Upper Bound on the Length of Minimal Synchronizing Word, FCT 2011, pp.173-180, 2011.
DOI : 10.1016/j.endm.2006.06.072

A. N. Trahtman, Modifying the upper bound on the length of minimal synchronizing word. ArXiv preprint, 2011.

M. V. Volkov, Synchronizing Automata and the ??ern?? Conjecture, Lecture Notes in Computer Science, vol.5196, pp.11-27, 2008.
DOI : 10.1007/978-3-540-88282-4_4