The following pages link to (Q2729242):
Displaying 27 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Synchronizing monotonic automata (Q703567) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Primitive and irreducible automata (Q747295) (← links)
- Synchronization (Q948067) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Image reducing words and subgroups of free groups. (Q1426037) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← 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)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- Reaching the minimum ideal in a finite semigroup (Q2362752) (← links)
- Synchronizing groups and automata (Q2503289) (← 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)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word (Q3088281) (← links)
- Notable trends concerning the synchronization of graphs and automata (Q3439497) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215) (← 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)
- Finding DFAs with Maximal Shortest Synchronizing Word Length (Q5739001) (← links)
