The road coloring problem
 A. N. Trahtman
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into a deterministic finite automaton possessing a synchronizing word. The road coloring problem is the problem of synchronizing coloring of a directed finite strongly connected graph with constant outdegree of all its vertices if the greatest common divisor of lengths of all its cycles is one. The problem was posed by Adler, Goodwyn and Weiss over 30 years ago and evoked noticeable interest among the specialists in the theory of graphs, deterministic automata and symbolic dynamics. The positive solution of the road coloring problem is presented.
 Adler, R. L., Goodwyn, L. W., Weiss, B. (1977) Equivalence of topological Markov shifts. Israel Journal of Mathematics 27: pp. 4963 CrossRef
 R. L. Adler and B. Weiss, Similarity of automorphisms of the torus, Memoirs of the American Mathematical Society, vol. 98, Providence, RI, 1970.
 Budzban, G., Mukherjea, A. (2000) A semigroup approach to the Road Coloring Problem, Probability on Algebraic Structures. Contemporary Mathematics 261: pp. 195207
 Carbone, A. (2001) Cycles of relatively prime length and the road coloring problem. Israel Journal of Mathematics 123: pp. 303316 CrossRef
 Culik, K., Karhumaki, J., Kari, J. (2002) A note on synchronized automata and Road Coloring Problem. Developments in Language Theory (5th Int. Conf., Vienna, 2001) 2295: pp. 175185
 Friedman, J. (1990) On the road coloring problem. Proceedings of the American Mathematical Society 110: pp. 11331135 CrossRef
 Gocka, E., Kirchherr, W., Schmeichel, E. (1998) A note on the roadcoloring conjecture. Ars Combinatoria. Charles Babbage Res. Centre 49: pp. 265270
 R. Hegde and K. Jain, MinMax theorem about the Road Coloring Conjecture, EuroComb 2005, DMTCS proc., AE, 2005, pp. 279–284.
 Jonoska, N., Suen, S. (1995) Monocyclic decomposition of graphs and the road coloring problem. Congressum Numerantium 110: pp. 201209
 Kari, J. (2001) Synchronizing finite automata on Eulerian digraphs, in Mathematical foundations of computer science, 2001 (Mariánské Láznӗ). Lecture Notes in Comput. Sci.. Springer, Berlin, pp. 432438
 D. Lind and B. Marcus, An Introduction of Symbolic Dynamics and Coding, Cambridge University Press, 1995.
 Mateescu, A., Salomaa, A. (1999) ManyValued Truth Functions, Černy’s conjecture and road coloring. Bulletin of the European Association for Theoretical Computer Science. EATCS 68: pp. 134148
 O’Brien, G. L. (1981) The road coloring problem. Israel Journal of Mathematics 39: pp. 145154 CrossRef
 Perrin, D., Schǔtzenberger, M. P. (1992) Synchronizing prefix codes and automata, and the road coloring problem, in Symbolic dynamics and its applications (New Haven, CT, 1991). Contemp. Math.. Amer. Math. Soc., Providence, RI, pp. 295318
 Pin, J. E. (1983) On two combinatorial problems arising from automata theory. Annals of Discrete Math. 17: pp. 535548
 Trahtman, A. N. (2006) Notable trends concerning the synchronization of graphs and automata, in CTW2006—CologneTwente Workshop on Graphs and Combinatorial Optimization. Electron. Notes Discrete Math.. Elsevier, Amsterdam, pp. 173175
 Title
 The road coloring problem
 Journal

Israel Journal of Mathematics
Volume 172, Issue 1 , pp 5160
 Cover Date
 20090701
 DOI
 10.1007/s1185600900625
 Print ISSN
 00212172
 Online ISSN
 15658511
 Publisher
 The Hebrew University Magnes Press
 Additional Links
 Topics
 Industry Sectors
 Authors

 A. N. Trahtman ^{(1)}
 Author Affiliations

 1. Department of Mathematics, BarIlan University, 52900, Ramat Gan, Israel