Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/102288
Title: | On the probability of being synchronizable |
Authors: | Berlinkov, M. V. |
Issue Date: | 2016 |
Publisher: | Springer Verlag |
Citation: | Berlinkov M. V. On the probability of being synchronizable / M. V. Berlinkov. — DOI 10.1007/978-3-319-29221-2_7 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2016. — Vol. 9602. — P. 73-84. |
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. © Springer International Publishing Switzerland 2016. |
Keywords: | COMPUTER SCIENCE COMPUTERS BINARY ALPHABETS CONVERGENCE RATES HIGH PROBABILITY ARTIFICIAL INTELLIGENCE |
URI: | http://elar.urfu.ru/handle/10995/102288 |
Access: | info:eu-repo/semantics/openAccess |
SCOPUS ID: | 84959097268 |
PURE ID: | 703557 47628603-cb84-4dda-810a-e23a1b3a3011 |
ISSN: | 3029743 |
ISBN: | 9783319292205 |
DOI: | 10.1007/978-3-319-29221-2_7 |
Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2-s2.0-84959097268.pdf | 377,81 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.