Pages that link to "Item:Q5756675"

The following pages link to An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture (Q5756675):

Displayed 23 items.

• Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) ‎ (← links)
• Černý conjecture for edge-colored digraphs with few junctions (Q510555) ‎ (← links)
• The Černý conjecture for one-cluster automata with prime length cycle (Q719288) ‎ (← links)
• Shortest synchronizing strings for Huffman codes (Q837184) ‎ (← links)
• Synchronizing automata with a letter of deficiency 2 (Q880170) ‎ (← 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)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) ‎ (← links)
• Černý's conjecture and group representation theory (Q2269531) ‎ (← links)
• Computing the shortest reset words of synchronizing automata (Q2354297) ‎ (← links)
• Complexity of road coloring with prescribed reset words (Q2424693) ‎ (← links)
• On the Synchronizing Probability Function and the Triple Rendezvous Time (Q2799174) ‎ (← links)
• Experiments with Synchronizing Automata (Q2830218) ‎ (← links)
• Synchronizing Automata with Extremal Properties (Q2946348) ‎ (← links)
• COMPAS - A Computing Package for Synchronization (Q3073624) ‎ (← links)
• Synchronizing Automata and the Černý Conjecture (Q3540093) ‎ (← links)
• Shortest Synchronizing Strings for Huffman Codes (Q3599120) ‎ (← links)
• Matrix Mortality and the Černý-Pin Conjecture (Q3637214) ‎ (← links)
• Attainable Values of Reset Thresholds (Q5111255) ‎ (← links)
• Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) ‎ (← links)
• Finding DFAs with Maximal Shortest Synchronizing Word Length (Q5739001) ‎ (← links)
• The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) ‎ (← links)