The Road Coloring for Mapping on k States(withdrawn)
| dc.creator | Trahtman, A. N. | |
| dc.date | 2008-12-28 | |
| dc.date | 2009-01-05 | |
| dc.date.accessioned | 2026-07-07T12:24:27Z | |
| dc.date.available | 2026-07-07T12:24:27Z | |
| dc.description | Let $Γ$ be directed strongly connected finite graph of uniform outdegree (constant outdegree of any vertex) and let some coloring of edges of $Γ$ 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 $Γ$ and let $Γs$ be a mapping of vertices $Γ$. | |
| dc.description | withdrawn, the result was known | |
| dc.identifier | https://arxiv.org/abs/0812.4798 | |
| dc.identifier | http://arxiv.org/abs/0812.4798 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/214331 | |
| dc.subject | Discrete Mathematics | |
| dc.title | The Road Coloring for Mapping on k States(withdrawn) | |
| dc.type | text |