Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102493
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFominykh, F. M.en
dc.contributor.authorMartyugin, P. V.en
dc.contributor.authorVolkov, M. V.en
dc.date.accessioned2021-08-31T15:03:52Z-
dc.date.available2021-08-31T15:03:52Z-
dc.date.issued2013-
dc.identifier.citationFominykh F. M. P(l)aying for synchronization / F. M. Fominykh, P. V. Martyugin, M. V. Volkov. — DOI 10.1142/S0129054113400170 // International Journal of Foundations of Computer Science. — 2013. — Vol. 24. — Iss. 6. — P. 765-780.en
dc.identifier.issn1290541-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Green3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84891459955&doi=10.1142%2fS0129054113400170&partnerID=40&md5=b25b7c6c461e381dc609e0d355b18c7f
dc.identifier.otherhttp://arxiv.org/pdf/1205.2174m
dc.identifier.urihttp://hdl.handle.net/10995/102493-
dc.description.abstractTwo topics are presented: synchronization games and synchronization costs. In a synchronization game on a deterministic finite automaton, there are two players, Alice and Bob, whose moves alternate. Alice wants to synchronize the given automaton, while Bob aims to make her task as hard as possible. We answer a few natural questions related to such games. Speaking about synchronization costs, we consider deterministic automata in which each transition has a certain price. The problem is whether or not a given automaton can be synchronized within a given budget. We determine the complexity of this problem. © 2013 World Scientific Publishing Company.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceInt. J. Found. Comput. Sci.2
dc.sourceInternational Journal of Foundations of Computer Scienceen
dc.subjectCOMPUTATIONAL COMPLEXITYen
dc.subjectDETERMINISTIC FINITE AUTOMATONen
dc.subjectDETERMINISTIC WEIGHTED AUTOMATONen
dc.subjectSYNCHRONIZATION GAMEen
dc.subjectSYNCHRONIZING AUTOMATONen
dc.titleP(l)aying for synchronizationen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1142/S0129054113400170-
dc.identifier.scopus84891459955-
local.contributor.employeeFominykh, F.M., Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russian Federation
local.contributor.employeeMartyugin, P.V., Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russian Federation
local.contributor.employeeVolkov, M.V., Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russian Federation
local.description.firstpage765-
local.description.lastpage780-
local.issue6-
local.volume24-
local.contributor.departmentInstitute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russian Federation
local.identifier.pure877874-
local.identifier.purec8d8a3f0-0110-4a55-8721-9aec5b0f9b95uuid
local.identifier.eid2-s2.0-84891459955-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84891459955.pdf192,45 kBAdobe PDFView/Open


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