Pages that link to "Item:Q3637215"
From MaRDI portal
The following pages link to A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215):
Displaying 6 items.
- On incomplete and synchronizing finite sets (Q517035) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- ON A CONJECTURE BY CARPI AND D'ALESSANDRO (Q2909095) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
