Pages that link to "Item:Q3476281"
From MaRDI portal
The following pages link to Reset Sequences for Monotonic Automata (Q3476281):
Displayed 37 items.
- Groups synchronizing a transformation of non-uniform kernel (Q391192) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- Orienting polygonal parts without sensors (Q686743) (← links)
- Synchronizing monotonic automata (Q703567) (← 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)
- 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)
- 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 quadratic algorithm for road coloring (Q2449052) (← 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)
- 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)
- Notable trends concerning the synchronization of graphs and automata (Q3439497) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Shortest Synchronizing Strings for Huffman Codes (Q3599120) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← 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)
- Estimation of the length of reset words for automata with simple idempotents (Q5951300) (← links)
- Orienting polyhedral parts by pushing (Q5959552) (← links)