Pages that link to "Item:Q5111255"
From MaRDI portal
The following pages link to Attainable Values of Reset Thresholds (Q5111255):
Displaying 7 items.
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- (Q5005150) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)