The Cerny Conjecture Holds with High Probability
From MaRDI portal
Publication:5208376
Recommendations
- The Tu-Deng conjecture holds almost surely
- Brouwer's conjecture holds asymptotically almost surely
- Cercignani's conjecture is sometimes true and always almost true
- A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem
- On a conjecture of Ciliberto
- On the probabilistic proof of the convergence of the Collatz conjecture
- A probabilistic proof of Schoenberg's theorem
- The Alexander-Orbach conjecture holds in high dimensions
- A new proof of Friedman's conjecture
Cited in
(16)- Černý's conjecture and the road colouring problem
- Careful synchronization of partial deterministic finite automata
- Circular automata synchronize with high probability
- On the probability of being synchronizable
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- The synchronizing probability function of an automaton
- Synchronizing automata with random inputs (short paper)
- Synchronizing random automata on a 4-letter alphabet
- Synchronizing random automata
- On the meeting of random walks on random DFA
- Synchronizing words under \textsf{LTL} constraints
- Fast synchronization of inhomogenous random automata
- Short Synchronizing Words for Random Automata
- Short synchronizing words for random automata
- Random deterministic automata with one added transition
This page was built for publication: The Cerny Conjecture Holds with High Probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208376)
