Pages that link to "Item:Q1678749"
From MaRDI portal
The following pages link to Approximating the minimum length of synchronizing words is hard (Q1678749):
Displaying 21 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← 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)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- (Q3569729) (redirect page) (← links)
- (Q4453477) (← links)
- Finding short synchronizing words for prefix codes (Q5005121) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- (Q5150411) (← links)
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
- Experimental Study of the Shortest Reset Word of Random Automata (Q5200075) (← links)
- (Q5740433) (← links)
