Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102288
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBerlinkov, M. V.en
dc.date.accessioned2021-08-31T15:02:59Z-
dc.date.available2021-08-31T15:02:59Z-
dc.date.issued2016-
dc.identifier.citationBerlinkov 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.en
dc.identifier.isbn9783319292205-
dc.identifier.issn3029743-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Green3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959097268&doi=10.1007%2f978-3-319-29221-2_7&partnerID=40&md5=44aa2a037375f8919e191968a7f44373
dc.identifier.otherhttp://arxiv.org/pdf/1304.5774m
dc.identifier.urihttp://hdl.handle.net/10995/102288-
dc.description.abstractWe 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.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceLect. Notes Comput. Sci.2
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectCOMPUTER SCIENCEen
dc.subjectCOMPUTERSen
dc.subjectBINARY ALPHABETSen
dc.subjectCONVERGENCE RATESen
dc.subjectHIGH PROBABILITYen
dc.subjectARTIFICIAL INTELLIGENCEen
dc.titleOn the probability of being synchronizableen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1007/978-3-319-29221-2_7-
dc.identifier.scopus84959097268-
local.contributor.employeeBerlinkov, M.V., Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, 620000, Russian Federation
local.description.firstpage73-
local.description.lastpage84-
local.volume9602-
local.contributor.departmentInstitute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, 620000, Russian Federation
local.identifier.pure703557-
local.identifier.pure47628603-cb84-4dda-810a-e23a1b3a3011uuid
local.identifier.eid2-s2.0-84959097268-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84959097268.pdf377,81 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.