Pages that link to "Item:Q1763695"
From MaRDI portal
The following pages link to Synchronizing generalized monotonic automata (Q1763695):
Displayed 16 items.
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- The annulation threshold for partially monotonic automata (Q845077) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE (Q2909105) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Shortest Synchronizing Strings for Huffman Codes (Q3599120) (← links)
- Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)