The following pages link to (Q4439451):
Displayed 4 items.
- Shortest directing words of nondeterministic directable automata (Q947810) (← links)
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)