The following pages link to Theory Is Forever (Q5894871):
Displaying 9 items.
- A lower bound for the length of the shortest carefully synchronizing words (Q845082) (← 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)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata (Q5448671) (← links)
