Pages that link to "Item:Q845082"
From MaRDI portal
The following pages link to A lower bound for the length of the shortest carefully synchronizing words (Q845082):
Displayed 10 items.
- 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)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Preset Distinguishing Sequences and Diameter of Transformation Semigroups (Q2799186) (← links)
- Subset Synchronization and Careful Synchronization of Binary Finite Automata (Q2833542) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- On the smallest synchronizing terms of finite tree automata (Q6199864) (← links)