Pages that link to "Item:Q3073634"
From MaRDI portal
The following pages link to Approximating Minimum Reset Sequences (Q3073634):
Displaying 10 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q5005121) (← links)
