On the Number of Synchronizing Colorings of Digraphs


We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of such a digraph can be colored by elements of some fixed k-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph… (More)
DOI: 10.1007/978-3-319-22360-5_11

7 Figures and Tables


  • Presentations referencing similar topics