Skip to search formSkip to main contentSkip to account menu

Road coloring theorem

Known as: Road colouring conjecture, Road-colouring problem, Road-coloring problem 
In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Let G be a strongly connected, aperiodic, two-out digraph with adjacency matrix A. Suppose A = R + B are coloring matrices: that… 
2008
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that… 
2008
2008
2007
Review
2006
Review
2006
Environmental Predictors of Bottlenose Dolphin Distribution and Core Feeding Densities in Galveston Bay, Texas. (May 2005) Maria… 
2004
2004
AbstractThe road coloring problem has been open for some 25 years. This paper shows how algebraic methods, specifically semigroup… 
2002
2002
  • J. Kari
  • 2002
  • Corpus ID: 12009735
Let G =( V,E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is… 
2001
2001
We give a partial answer to theroad coloring problem, a purely graphtheoretical question with applications in both symbolic…