Pages that link to "Item:Q376118"
From MaRDI portal
The following pages link to Primitive digraphs with large exponents and slowly synchronizing automata (Q376118):
Displayed 26 items.
- Lifespan in a primitive Boolean linear dynamical system (Q907226) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Analytic methods for reachability problems (Q2037188) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q5005150) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)