Road coloring problem
(Q1937896)
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
Language:
Current Data About
Road coloring problem
(P31) |
(Q65943)
|
||
(P1136) |
(Q2874512)
|
||
(P6104) |
(Q8487137)
|
other details
description | theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton |
External Links
(P646) |
/m/0h7r36
|
(P2812) |
RoadColoringProblem
|
(P6366) |
2778946484
|