Pages that link to "Item:Q2946348"
From MaRDI portal
The following pages link to Synchronizing Automata with Extremal Properties (Q2946348):
Displaying 11 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)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- (Q5005150) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
