Pages that link to "Item:Q2074216"

The following pages link to Černý's conjecture and the road colouring problem (Q2074216):

Displaying 12 items.

• Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
• Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
• Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
• Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
• Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
• Synchronizing Automata with Extremal Properties (Q2946348) (← links)
• On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
• Attainable Values of Reset Thresholds (Q5111255) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
• Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
• New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)
• Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)