Pages that link to "Item:Q3586114"

The following pages link to The Complexity of Finding Reset Words in Finite Automata (Q3586114):

Displaying 24 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)
• Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
• Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
• The NP-completeness of the road coloring problem (Q1944896) (← links)
• Černý's conjecture and the road colouring problem (Q2074216) (← links)
• Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
• Preimage problems for deterministic finite automata (Q2208257) (← 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)
• A quadratic algorithm for road coloring (Q2449052) (← links)
• Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
• On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
• Synchronizing Automata over Nested Words (Q2811343) (← 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)
• Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
• Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
• (Q5005150) (← links)
• Attainable Values of Reset Thresholds (Q5111255) (← 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)