Pages that link to "Item:Q880170"
From MaRDI portal
The following pages link to Synchronizing automata with a letter of deficiency 2 (Q880170):
Displaying 18 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Synchronizing random automata on a 4-letter alphabet (Q376130) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- Slowly synchronizing automata with zero and noncomplete sets (Q2435786) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE (Q2909105) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Synchronizing Automata of Bounded Rank (Q2914705) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Reset Thresholds of Automata with Two Cycle Lengths (Q3192265) (← 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)
- Experimental Study of the Shortest Reset Word of Random Automata (Q5200075) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
