The Road Coloring for Mapping on k States(withdrawn)

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-478204

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.