{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:10:32Z","timestamp":1784527832218,"version":"3.55.0"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> Two 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. <\/jats:p>","DOI":"10.1142\/s0129054113400170","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T03:17:54Z","timestamp":1388114274000},"page":"765-780","source":"Crossref","is-referenced-by-count":5,"title":["P(L)AYING FOR SYNCHRONIZATION"],"prefix":"10.1142","volume":"24","author":[{"given":"F. M.","family":"FOMINYKH","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. V.","family":"MARTYUGIN","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. V.","family":"VOLKOV","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.01.010"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/11759744_3"},{"issue":"3","key":"p_4","first-page":"208","volume":"14","author":"\u010cern\u00fd J.","year":"1964","journal-title":"Akad. Vied"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1137\/0219033"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31606-7_14"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1137\/100816109"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13182-0_27"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263534"},{"key":"p_12","first-page":"535","volume":"17","author":"Pin J.-E.","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1007\/11498490_2"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-009-0062-5"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22953-4_15"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88282-4_4"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:10:38Z","timestamp":1565107838000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":13,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400170"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400170","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}