Pages that link to "Item:Q2946340"
From MaRDI portal
The following pages link to Strong Inapproximability of the Shortest Reset Word (Q2946340):
Displaying 14 items.
- Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q3304155) (← links)
- Finding short synchronizing words for prefix codes (Q5005121) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)