D. Achlioptas, Lower bounds for random 3-SAT via differential equations, Theoretical Computer Science, vol.265, issue.1-2, pp.159-185, 2001.
DOI : 10.1016/S0304-3975(01)00159-1

D. S. Ananichev, M. V. Volkov, and Y. I. Zaks, Synchronizing automata with a letter of deficiency 2, Theoretical Computer Science, vol.376, issue.1-2, pp.30-41, 2007.
DOI : 10.1016/j.tcs.2007.01.010

S. Asmussen and H. Hering, Branching processes, p.Birkhäuser, 1983.

]. J. Cern´ycern´y, Poznámka k homogénnym eksperimentom s kone?n´kone?n´ymi automatami, Matematickofyzikalny?asopisfyzikalny?fyzikalny?asopis Slovensk, Akad. Vied, vol.14, issue.4, pp.208-216, 1964.

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

B. Gertbakh, Epidemic process on a random graph: some preliminary results, Journal of Applied Probability, vol.14, issue.03, pp.427-438, 1977.
DOI : 10.1137/1114078

P. M. Higgins, The range order of a product of i transformations from a finite full transformation semigroup, Semigroup Forum, vol.19, issue.1, pp.31-36, 1988.
DOI : 10.1007/BF02573120

J. Jaworski, Epidemic processes on digraphs of random mappings, Journal of Applied Probability, vol.36, issue.3, pp.780-798, 1999.
DOI : 10.1239/jap/1032374634

C. H. Papadimitriou and E. Koutsoupias, On the greedy algorithm for satisfiability, Information Processing Letters, vol.43, pp.53-55, 1992.

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

P. Raghavan and R. Motwani, Randomized Algorithms, 1995.

W. Samotij, A note on the complexity of the problem of finding shortest synchronizing words, Proc. AutoMathA, 2007.

N. C. Wormald, Differential Equations for Random Processes and Random Graphs, The Annals of Applied Probability, vol.5, issue.4, pp.1217-1235, 1995.
DOI : 10.1214/aoap/1177004612