Highly Influenced

@inproceedings{Trakhtman2008TheRC, title={The Road Coloring and Cerny Conjecture}, author={Avraham Trakhtman}, booktitle={Stringology}, year={2008} }

- Published 2008 in Stringology

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â€¦Â CONTINUE READING