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 12 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← 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)
- Computational complexity of synchronization under regular commutative constraints (Q2019491) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)