Pages that link to "Item:Q719288"

The following pages link to The Černý conjecture for one-cluster automata with prime length cycle (Q719288):

Displaying 36 items.

• The Černý conjecture and 1-contracting automata (Q311503) (← links)
• Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← 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)
• Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
• Resetting words for decidable automata (Q1905219) (← links)
• A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
• Simplicity of augmentation submodules for transformation monoids (Q2042297) (← 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)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
• Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
• Synchronizing sequences for road colored digraphs (Q2197412) (← links)
• Preimage problems for deterministic finite automata (Q2208257) (← links)
• Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
• Reliable \(L_1\) control of positive switched systems with time-varying delays (Q2360473) (← links)
• A counter example to a conjecture concerning synchronizing words in finite automata (Q2729242) (← links)
• An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
• Experiments with Synchronizing Automata (Q2830218) (← links)
• The averaging trick and the Černý conjecture (Q2909105) (← links)
• Synchronizing Automata on Quasi-Eulerian Digraph (Q2914697) (← links)
• Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
• Synchronizing Automata with Extremal Properties (Q2946348) (← links)
• (Q3304155) (← links)
• Les automates circulaires biaisés vérifient la conjecture de Černý (Q4341035) (← links)
• Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• (Q5192683) (← links)
• Cliques and colorings in generalized Paley graphs and an approach to synchronization (Q5251112) (← links)
• Synchronised automata (Q5365563) (← links)
• On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
• SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA (Q5401552) (← links)
• Finding DFAs with Maximal Shortest Synchronizing Word Length (Q5739001) (← links)
• Semisimple synchronizing automata and the Wedderburn-Artin theory (Q5890812) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)