arXiv (All)
open access
On the probability of being synchronizable
We prove that a random binary automaton with $n$ states is synchronizing with high probability and the asymptotic is exactly $1-Θ(\frac{1}{n})$ as conjectured in [Cameron, 2011]. We also present a deterministic algorithm which decides whether a given random automaton is synchronizing in expected tim
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Contextual Accuracy Dominance Argument for Probabilism#95963
- On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem#175146
- Optimal testing of fermionic and bosonic Gaussian states#1144080
- The Drift Lemma and the Limits of Self-Measurement in Bounded Systems#82267
- Probabilism for stochastic theories#770850
Record · ID 1156120
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive