Pages that link to "Item:Q2914716"
From MaRDI portal
The following pages link to Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716):
Displayed 3 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)