D. Aldous, G. Miermont, and J. Pitman, Brownian Bridge Asymptotics for Random $p$-Mappings, Electronic Journal of Probability, vol.9, issue.0, pp.37-56, 2004.
DOI : 10.1214/EJP.v9-186
URL : https://hal.archives-ouvertes.fr/hal-00102164

V. Mikhail and . Berlinkov, On the probability of being synchronizable, Algorithms and Discrete Applied Mathematics ? Second International Conference, CALDAM 2016 Proceedings, volume 9602 of Lecture Notes in Computer Science, pp.73-84, 2016.

V. Mikhail, M. Berlinkov, and . Szykula, Algebraic synchronization criterion and computing reset words, Mathematical Foundations of Computer Science 2015 ? 40th International Symposium, MFCS 2015 Proceedings, Part I, pp.103-115, 2015.

J. Peter and . Cameron, Dixon's theorem and random synchronization, Discrete Mathematics, issue.11, pp.3131233-1236, 2013.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Frankl, An Extremal Problem for two Families of Sets, European Journal of Combinatorics, vol.3, issue.2, pp.125-127, 1982.
DOI : 10.1016/S0195-6698(82)80025-5

B. Harris, Probability distributions related to random mappings. The Annals of Mathematical Statistics, pp.1045-1062, 1960.
DOI : 10.1214/aoms/1177705677
URL : http://doi.org/10.1214/aoms/1177705677

R. M. Karp, The transitive closure of a random digraph, Random Structures and Algorithms, vol.7, issue.1, pp.73-94, 1990.
DOI : 10.1007/978-3-642-65371-1

A. Kisielewicz, J. Kowalski, and M. Szykula, A Fast Algorithm Finding the Shortest Reset Words, Lecture Notes in Computer Science, vol.7936, pp.182-196, 2013.
DOI : 10.1007/978-3-642-38768-5_18

F. Valentin and . Kol?in, Random Mappings: Translation Series in Mathematics and Engineering. Translations series in mathematics and engineering, 1986.

C. Nicaud and . Random, Random Deterministic Automata, Mathematical Foundations of Computer Science 2014 ? 39th International Symposium, MFCS 2014 Proceedings , Part I, pp.5-2310, 2014.
DOI : 10.1007/978-3-662-44522-8_2
URL : https://hal.archives-ouvertes.fr/hal-01226599

J. Olschewski and M. Ummels, The Complexity of Finding Reset Words in Finite Automata, MFCS, volume 6281 of Lecture Notes APPROX, p.16
DOI : 10.1007/978-3-642-15155-2_50

J. Pin, On two combinatorial problems arising from automata thery, Annals of Discrete Mathematics, vol.17, pp.535-548, 1983.
DOI : 10.1016/s0304-0208(08)73432-7

J. Quisquater and J. Vandewalle, Advances in Cryptology ? EU- ROCRYPT'89, Workshop on the Theory and Application of of Cryptographic Techniques, Proceedings, volume 434 of Lecture Notes in Computer Science, 1989.

S. Evgeny, Y. Skvortsov, and . Zaks, Synchronizing random automata, Discrete Mathematics & Theoretical Computer Science, vol.12, issue.4, pp.95-108, 2010.

. ?erný, Poznámka k. homogénnym experimentom s konecnymi automatmi, Matematickofyzikalny ?asopis Slovensk, vol.14, 1964.

V. Mikhail and . Volkov, Synchronizing Automata and the Cerny Conjecture Revised Papers, Language and Automata Theory and Applications, Second International Conference, pp.11-27, 2008.

Y. Zaks and E. S. Skvortsov, Synchronizing random automata on a 4-letter alphabet, Journal of Mathematical Sciences, vol.5196, issue.4, pp.303-306, 2013.
DOI : 10.1007/978-3-540-88282-4_4