Pages that link to "Item:Q3130423"

The following pages link to Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423):

Displaying 12 items.

• Analytic methods for reachability problems (Q2037188) (← links)
• Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
• (Q5005150) (← 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)
• Recognition of matrices which are sign-regular of a given order and a generalization of oscillatory matrices (Q5862852) (← links)
• Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
• Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
• New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)