Pages that link to "Item:Q3569754"
From MaRDI portal
The following pages link to Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA (Q3569754):
Displaying 6 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)
- P(l)aying for Synchronization (Q2914704) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
