Computer Science – Discrete Mathematics
Scientific paper
2008-12-28
Computer Science
Discrete Mathematics
withdrawn, the result was known
Scientific paper
Let $\Gamma$ be directed strongly connected finite graph of uniform outdegree
(constant outdegree of any vertex) and let some coloring of edges of $\Gamma$
turn the graph into deterministic complete automaton. Let the word $s$ be a
word in the alphabet of colors (considered also as letters) on the edges of
$\Gamma$ and let $\Gamma s$ be a mapping of vertices $\Gamma$.
No associations
LandOfFree
The Road Coloring for Mapping on k States(withdrawn) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Road Coloring for Mapping on k States(withdrawn), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Road Coloring for Mapping on k States(withdrawn) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-478204