The following pages link to (Q2707235):
Displaying 13 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)
- The complexity of synchronizing Markov decision processes (Q1740670) (← 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)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q5089200) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (Q5200066) (← links)
