2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/214331Let $Γ$ 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 $Γ$.withdrawn, the result was knownDiscrete Mathematicstext