Road coloring problem (Q1937896)

From Wikidata
Jump to: navigation, search
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton
edit
Language Label Description Also known as
English
Road coloring problem
theorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automaton

    Statements

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit