Pages that link to "Item:Q3476281"
From MaRDI portal
The following pages link to Reset Sequences for Monotonic Automata (Q3476281):
Displayed 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)
- 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)
- 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)
- On the Synchronizing Probability Function and the Triple Rendezvous Time (Q2799174) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (Q2841998) (← links)
- ON A CONJECTURE BY CARPI AND D'ALESSANDRO (Q2909095) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- WORDS GUARANTEEING MINIMUM IMAGE (Q3021997) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)