Pages that link to "Item:Q3086238"
From MaRDI portal
The following pages link to A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (Q3086238):
Displaying 26 items.
- The Černý conjecture and 1-contracting automata (Q311503) (← links)
- On incomplete and synchronizing finite sets (Q517035) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Random walk in a finite directed graph subject to a road coloring (Q742112) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- An algorithm for road coloring (Q1932365) (← 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)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← 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)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- ON A CONJECTURE BY CARPI AND D'ALESSANDRO (Q2909095) (← links)
- Synchronizing Automata of Bounded Rank (Q2914705) (← links)
- Synchronizing Automata with Extremal Properties (Q2946348) (← links)
- (Q3304155) (← links)
- (Q5005121) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- (Q5005150) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)