The road coloring problem
- 245 Downloads
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.
Unable to display preview. Download preview PDF.
- R. L. Adler and B. Weiss, Similarity of automorphisms of the torus, Memoirs of the American Mathematical Society, vol. 98, Providence, RI, 1970.Google Scholar
- R. Hegde and K. Jain, Min-Max theorem about the Road Coloring Conjecture, Euro-Comb 2005, DMTCS proc., AE, 2005, pp. 279–284.Google Scholar
- 10]J. Kari, Synchronizing finite automata on Eulerian digraphs, in Mathematical foundations of computer science, 2001 (Mariánské Láznӗ), Lecture Notes in Comput. Sci., vol. 2136, Springer, Berlin, 2001, pp. 432–438.Google Scholar
- D. Lind and B. Marcus, An Introduction of Symbolic Dynamics and Coding, Cambridge University Press, 1995.Google Scholar
- D. Perrin and M. P. Schǔtzenberger, Synchronizing prefix codes and automata, and the road coloring problem, in Symbolic dynamics and its applications (New Haven, CT, 1991), Contemp. Math., vol. 135, Amer. Math. Soc., Providence, RI, 1992, pp. 295–318.Google Scholar
- A. N. Trahtman, Notable trends concerning the synchronization of graphs and automata, in CTW2006—Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Electron. Notes Discrete Math., vol. 25, Elsevier, Amsterdam, 2006, pp. 173–175.Google Scholar