Skip to main content
Conference Proceedings

On the probability of being synchronizable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9602 73-84
DOI: 10.1007/978-3-319-29221-2_7
25Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that a random automaton with n states and any fixed non-singleton alphabet is synchronizing with high probability. Moreover, we also prove that the convergence rate is exactly (Formula presented) as conjectured by Cameron [4] for the most interesting binary alphabet case.

Cite

CITATION STYLE

APA

Berlinkov, M. V. (2016). On the probability of being synchronizable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9602, pp. 73–84). Springer Verlag. https://doi.org/10.1007/978-3-319-29221-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free