The road coloring problem

@article{Trahtman2007TheRC,
  title={The road coloring problem},
  author={A. N. Trahtman},
  journal={Israel Journal of Mathematics},
  year={2007},
  volume={172},
  pages={51-60}
}
  • A. Trahtman
  • Published 2007
  • Mathematics, Computer Science
  • Israel Journal of Mathematics
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… Expand
The Road Coloring and Cerny Conjecture
TLDR
The positive solution of the road coloring problem is presented and some consequences on the length of the synchronizing word are discussed. Expand
A Subquadratic Algorithm for Road Coloring
The 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 aExpand
Ja n 20 08 A Subquadratic Algorithm for Road Coloring
The 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 aExpand
An algorithm for road coloring
TLDR
A polynomial time algorithm of O(n3) complexity in the worst case and quadratic in the majority of studied cases for the road coloring of the considered graph is presented below. Expand
An algorithm for road coloring
A coloring of edges of a finite directed graph turns the graph into a finite-state automaton. A synchronizing word of a deterministic automaton is a word in the alphabet of colors of its edgesExpand
The Visualization of the Road Coloring Algorithm in the package TESTAS
TLDR
A polynomial time algorithm of the road coloring has been based on recent positive solution of this old famous problem and the new visualization program is used for demonstration of the algorithm as well as for visualization of the transition graph of any finite automaton. Expand
A partially synchronizing coloring
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at itsExpand
Synchronizing Road Coloring
The 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 aExpand
Linear Visualization of a Road Coloring Algorithm
A problem of a visual image of a directed finite graph has appeared in the study of the road coloring conjecture. Given a finite directed graph, a coloring of its edges turns the graph intoExpand
On Synchronizing Colorings and the Eigenvectors of Digraphs
TLDR
It is shown that a vector v has no partition of coordinates into blocks of equal sum if and only if all colorings of the digraphs associated with v are synchronizing. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Cycles of relatively prime length and the road coloring problem
We give a partial answer to theroad coloring problem, a purely graphtheoretical question with applications in both symbolic dynamics and automata theory. The question is whether for any positiveExpand
A Note on Synchronized Automata and Road Coloring Problem
TLDR
A relabeling method is introduced which can be used for a large class of automata to improve their "degree of synchronization" and allows, for example, to formulate the Road Coloring Conjecture in several equivalent ways. Expand
A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
We consider the problem of labeling a directed multigraph so that it becomes a synchronized finite automaton, as an ultimate goal to solve the famous Road Coloring Conjecture, cf. [1,2]. We introduceExpand
Notable trends concerning the synchronization of graphs and automata
  • A. Trakhtman
  • Computer Science
  • Electron. Notes Discret. Math.
  • 2006
TLDR
An effective program for search of automata with minimal reset word of relatively great length has studied all automata of size n ≤ 10 for q = 2 (q size of alphabet) and ofsize n ≤ 7 for q ≤ 4 and there are no contradictory examples for the Černy conjecture in this class of Automata. Expand
A Note on the Road-Coloring Conjecture
TLDR
It is shown that, if the outdegree of every edge in an n-vertex digraph is δ = ω(logn), a road-coloring for the graph exists and an equivalent re-statement of the conjecture is given in terms of the cross-product of two graphs. Expand
A Min-Max theorem about the Road Coloring Conjecture
The Road Coloring Conjecture is an old and classical conjecture e posed in Adler and Weiss (1970); Adler et al. (1977). Let $G$ be a strongly connected digraph with uniform out-degree $2$. The RoadExpand
On two Combinatorial Problems Arising from Automata Theory
We present some partial results on the following conjectures arising from automata theory. The first conjecture is the triangle conjecture due to Perrin and Schiitzenberger. Let A ={a, b } be aExpand
The road-colouring problem
LetG be a finite directed graph which is irreducible and aperiodic. Assume each vertex ofG leads to at least two other vertices, and assumeG has a cycle of prime length which is a proper subset ofG.Expand
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring
TLDR
Interconnections between many-valued truth functions and functions defined by finite deterministic automata is investigated, finding results in one theory, such as those concerning self-conjugacy of truth functions, can be applied in the other theory. Expand
Synchronizing finite automata on Eulerian digraphs
  • J. Kari
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
TLDR
This paper proves Fr?erný's conjecture and the road coloring problem are two open problems concerning synchronization of finite automata in the special case that the vertices have uniform in- and outdegrees. Expand
...
1
2
3
4
...