The Road Coloring for Mapping on k States(withdrawn)
A. N. Trahtman

TL;DR
This paper discusses the problem of road coloring in directed strongly connected graphs with uniform outdegree, focusing on automaton mappings induced by edge colorings, aiming to understand the conditions for synchronizing colorings.
Contribution
It introduces new insights into the road coloring problem for graphs with uniform outdegree and automaton mappings, extending previous theoretical frameworks.
Findings
Conditions for the existence of synchronizing colorings
Characterization of automaton mappings induced by edge colorings
Extensions to the theory of deterministic automata
Abstract
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 be a word in the alphabet of colors (considered also as letters) on the edges of and let be a mapping of vertices .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsColor Science and Applications
