Pages that link to "Item:Q989550"

The following pages link to Improved upper bounds on synchronizing nondeterministic automata (Q989550):

Displaying 9 items.

• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
• Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
• Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
• Preset Distinguishing Sequences and Diameter of Transformation Semigroups (Q2799186) (← links)
• Subset Synchronization and Careful Synchronization of Binary Finite Automata (Q2833542) (← links)
• Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
• Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
• Semicomputable points in Euclidean spaces (Q5092426) (← links)