The following pages link to (Q5629545):
Displayed 26 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- On primitivity of sets of matrices (Q900654) (← links)
- Synchronization (Q948067) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- Composition sequences for functions over a finite domain. (Q1853744) (← links)
- An algorithm for road coloring (Q1932365) (← 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)
- 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)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q3304155) (← links)
- Notable trends concerning the synchronization of graphs and automata (Q3439497) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)
- Games with Opacity Condition (Q3646261) (← links)
- Les automates circulaires biaisés vérifient la conjecture de Černý (Q4341035) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- (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)
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata (Q5448671) (← links)
- (Q5750412) (← links)