40 search results - page 1 / 8 » A Note on the Road-Coloring Conjecture |
ARSCOM
1998
14 years 11 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
145
click to vote
STRINGOLOGY
2008
15 years 1 months ago
2008
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...
75
Voted
DLT
2001
15 years 1 months ago
2001
108
click to vote
JUCS
2002
14 years 11 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
81
Voted
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Joseph Yucas and Gary Mullen conjectured that there is no self-reciprocal irreducible pentanomial of degree n over F2 if n is divisible by 6. In this note we prove this conjecture ...