Pages that link to "Item:Q5951300"

The following pages link to Estimation of the length of reset words for automata with simple idempotents (Q5951300):

Displaying 20 items.

• The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
• Some contributions to the theory of transformation monoids (Q1712470) (← links)
• Černý's conjecture and the road colouring problem (Q2074216) (← links)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
• Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
• Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
• Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
• Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291) (← links)
• Černý's conjecture and group representation theory (Q2269531) (← links)
• An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
• Synchronizing Automata of Bounded Rank (Q2914705) (← links)
• Lower Bounds for the Length of Reset Words in Eulerian Automata (Q3172873) (← links)
• Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
• (Q5005150) (← links)
• On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
• The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
• Binary completely reachable automata (Q6109017) (← links)
• New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)
• Reset thresholds of transformation monoids (Q6547250) (← links)