The following pages link to (Q3115697):
Displaying 8 items.
- 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)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Synchronizing Automata of Bounded Rank (Q2914705) (← 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)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- Extremal Binary PFAs with Small Number of States (Q6169960) (← links)
