Pages that link to "Item:Q3476281"

The following pages link to Reset Sequences for Monotonic Automata (Q3476281):

Displaying 50 items.

• The Černý conjecture and 1-contracting automata (Q311503) (← links)
• Groups synchronizing a transformation of non-uniform kernel (Q391192) (← links)
• Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
• Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
• Černý conjecture for edge-colored digraphs with few junctions (Q510555) (← links)
• Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
• Orienting polygonal parts without sensors (Q686743) (← links)
• Synchronizing monotonic automata (Q703567) (← links)
• The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
• Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
• Shortest synchronizing strings for Huffman codes (Q837184) (← links)
• Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
• The annulation threshold for partially monotonic automata (Q845077) (← links)
• A lower bound for the length of the shortest carefully synchronizing words (Q845082) (← links)
• Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
• On primitivity of sets of matrices (Q900654) (← links)
• Algorithms for media (Q947070) (← links)
• Synchronization (Q948067) (← links)
• A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
• Synchronizing finite automata with short reset words (Q1008633) (← links)
• Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
• Reset words for commutative and solvable automata (Q1392028) (← links)
• Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
• Synchronizing generalized monotonic automata (Q1763695) (← links)
• Composition sequences for functions over a finite domain. (Q1853744) (← links)
• The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
• The NP-completeness of the road coloring problem (Q1944896) (← links)
• Analytic methods for reachability problems (Q2037188) (← links)
• 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)
• Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
• Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
• Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
• Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
• Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
• Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
• Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
• Synchronizing sequences for road colored digraphs (Q2197412) (← 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)
• A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422) (← links)
• Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
• Complexity of road coloring with prescribed reset words (Q2424693) (← links)
• A quadratic algorithm for road coloring (Q2449052) (← links)
• Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)