Pages that link to "Item:Q1392028"

The following pages link to Reset words for commutative and solvable automata (Q1392028):

Displaying 31 items.

• The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
• The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
• Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
• The annulation threshold for partially monotonic automata (Q845077) (← links)
• Algorithms for media (Q947070) (← links)
• Shortest directing words of nondeterministic directable automata (Q947810) (← links)
• A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
• Composition sequences for functions over a finite domain. (Q1853744) (← links)
• A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← 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)
• Slowly synchronizing automata with zero and noncomplete sets (Q2435786) (← links)
• ON A CONJECTURE BY CARPI AND D'ALESSANDRO (Q2909095) (← links)
• THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE (Q2909105) (← links)
• Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
• (Q3304155) (← links)
• Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
• Genetic Algorithm for Synchronization (Q3618622) (← links)
• Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
• (Q5013886) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• Attainable Values of Reset Thresholds (Q5111255) (← links)
• A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
• On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
• The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
• Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
• Reset thresholds of transformation monoids (Q6547250) (← links)
• State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)