R. L. Adler, D. Coppersmith, and M. Hassner, Algorithms for sliding block codes---An application of symbolic dynamics to information theory, IEEE Transactions on Information Theory, vol.29, issue.1, pp.5-22, 1983.
DOI : 10.1109/TIT.1983.1056597

R. L. Adler, L. W. Goodwyn, and B. Weiss, Equivalence of topological Markov shifts, Israel Journal of Mathematics, vol.2, issue.1, pp.48-63, 1977.
DOI : 10.1007/BF02761605

M. Béal and D. Perrin, A quadratic algorithm for road coloring. CoRR, abs/0803, p.726, 2008.

J. Berstel, D. Perrin, and C. Reutenauer, Codes and automata, volume 129 of Encyclopedia of Mathematics and its Applications, 2010.

M. Boyle and A. Maass, Expansive invertible onesided cellular automata, Journal of the Mathematical Society of Japan, vol.52, issue.4, pp.725-740, 2000.
DOI : 10.2969/jmsj/05240725

M. Boyle and A. Maass, Erratum to "Expansive invertible onesided cellular automata", Journal of the Mathematical Society of Japan, vol.56, issue.1, pp.725-740309, 2000.
DOI : 10.2969/jmsj/1191418708

G. Budzban and P. Feinsilver, The generalized road coloring problem and periodic digraphs, Applicable Algebra in Engineering, Communication and Computing, vol.172, issue.1, pp.21-35, 2011.
DOI : 10.1007/s00200-010-0135-z

A. Carayol and C. Nicaud, Distribution of the number of accessible states in a random deterministic automaton, STACS Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.194-205, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678213

A. Carbone, Cycles of relatively prime length and the road coloring problem, Israel Journal of Mathematics, vol.105, issue.1, pp.303-316, 2001.
DOI : 10.1007/BF02784133

K. Culik, I. , J. Karhumäki, and J. Kari, Synchronized automata and road coloring problem, 1999.
DOI : 10.1007/3-540-46011-x_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.3880

K. Culik, I. , J. Karhumäki, and J. Kari, A Note on Synchronized Automata and Road Coloring Problem, Developments in language theory, pp.175-185, 2002.
DOI : 10.1007/3-540-46011-X_14

B. Delyon and O. Maler, On the effects of noise and speed on computations, Theoretical Computer Science, vol.129, issue.2, pp.279-291, 1994.
DOI : 10.1016/0304-3975(94)90029-9

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

C. F. Freiling, D. S. Jungreis, F. Théberge, and K. Zeger, Almost all complete binary prefix codes have a self-synchronizing string, IEEE Transactions on Information Theory, vol.49, issue.9, pp.2219-2225, 2003.
DOI : 10.1109/TIT.2003.815803

J. Friedman, On the road coloring problem, Proceedings of the American Mathematical Society, vol.110, issue.4, pp.1133-1135, 1990.
DOI : 10.1090/S0002-9939-1990-0953004-8

N. Jonoska and S. A. , A molecular computation of the road coloring problem, DNA based computers, pp.87-96, 1996.

H. Jürgensen, Synchronization, Information and Computation, vol.206, issue.9-10, pp.1033-1044, 2008.
DOI : 10.1016/j.ic.2008.03.005

J. Kari, Synchronizing finite automata on Eulerian digraphs, Theoretical Computer Science, vol.295, issue.1-3, pp.223-232, 2003.
DOI : 10.1016/S0304-3975(02)00405-X

J. Kari and M. V. Volkov, ? Cern´yCern´y's conjecture and the road coloring problem, Handbook of Automata. European Science Foundation, 2013.

D. A. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

C. Nicaud, On the synchronization of random deterministic automata. preprint, 2013.

G. L. O-'brien, The road-colouring problem, Israel J. Math, vol.39, issue.1 2, pp.145-154, 1981.

J. Olschewski and M. Ummels, The Complexity of Finding Reset Words in Finite Automata, MFCS, pp.568-579, 2010.
DOI : 10.1007/978-3-642-15155-2_50

D. Perrin and M. Schützenberger, Synchronizing prefix codes and automata and the road coloring problem, Symbolic dynamics and its applications, pp.295-318, 1992.
DOI : 10.1090/conm/135/1185096

I. Pomeranz and S. M. Reddy, Application of homing sequences to synchronous sequential circuit testing, IEEE Transactions on Computers, vol.43, issue.5, pp.569-580, 1994.
DOI : 10.1109/12.280804

A. Roman, The NP-completeness of the Road Coloring Problem, Information Processing Letters, vol.111, issue.7, pp.342-347, 2011.
DOI : 10.1016/j.ipl.2010.12.016

E. S. Skvortsov and Y. Zaks, Synchronizing random automata, Discrete Mathematics & Theoretical Computer Science, vol.12, issue.4, pp.95-108, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00990454

A. N. Trahtman, The road coloring problem, Israel Journal of Mathematics, vol.17, issue.1, pp.51-60, 2009.
DOI : 10.1007/s11856-009-0062-5

A. N. Trahtman, A Partially Synchronizing Coloring, Proceedings of CSR 2010, pp.362-370, 2010.
DOI : 10.1007/978-3-642-13182-0_36

A. N. Trahtman, An Algorithm for Road Coloring, Combinatorial algorithms, pp.349-360, 2011.
DOI : 10.1007/978-3-642-25011-8_28