{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:23Z","timestamp":1784484143400,"version":"3.55.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_24","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:28:51Z","timestamp":1784482131000},"page":"358-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adversarial Synchronization and\u00a0Reset Length"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6545-2269","authenticated-orcid":false,"given":"Anton E.","family":"Lipin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9327-243X","authenticated-orcid":false,"given":"Mikhail V.","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1090\/S0002-9947-08-04712-0","volume":"361","author":"J Almeida","year":"2009","unstructured":"Almeida, J., Margolis, S., Steinberg, B., Volkov, M.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc. 361(3), 1429\u20131461 (2009). https:\/\/doi.org\/10.1090\/S0002-9947-08-04712-0","journal-title":"Trans. Amer. Math. Soc."},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Almeida, J., Steinberg, B.: Matrix mortality and the \u010cern\u00fd\u2013Pin conjecture. In: Diekert, V., Nowotka, D., (eds.) Developments in Language Theory (DLT 2009), Lect. Notes Comput. Sci. vol.\u00a05583, pp.\u00a067\u201380. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_5","DOI":"10.1007\/978-3-642-02737-6_5"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency\u00a02. In: Ibarra, O.H., Dang, Z,. (eds.) Developments in Language Theory (DLT 2006), Lect. Notes Comput. Sci. vol.\u00a04036, pp.\u00a0433\u2013442. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11779148_39","DOI":"10.1007\/11779148_39"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"DS Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci. 376, 30\u201341 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.01.010","journal-title":"Theor. Comput. Sci."},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., Veanes, M.: Play to test. In: Grieskamp, W., Weise, C., (eds.) Formal Approaches to Software Testing (FATES 2005), Lect. Notes Comput. Sci. vol.\u00a03997, pp.\u00a032\u201346. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11759744_3","DOI":"10.1007\/11759744_3"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Fernau, H., Haase, C., Hoffmann, S.: The synchronization game on subclasses of automata. In: Fraigniaud, P., Uno, Y., (eds.) Fun with Algorithms (FUN 2022), Leibniz Int. Proc. Inform. vol.\u00a0226, pp.\u00a014:1\u201314:17. Schloss Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2022.14","DOI":"10.4230\/LIPIcs.FUN.2022.14"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Fernau, H., Haase, C., Hoffmann, S., Volkov, M.: Winning strategies for the synchronization game on subclasses of finite automata. In: Manea, F., Pighizzini, G., (eds.) Non-Classical Models of Automata and Applications. Electron. Proc. Theor. Comput. Sci. pp. 77\u201385 (2024). https:\/\/doi.org\/10.4204\/EPTCS.407.6","DOI":"10.4204\/EPTCS.407.6"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Fernau, H., Haase, C., Hoffmann, S., Volkov, M.: Uniform winning strategies for the synchronization game on subclasses of finite automata. J. Autom. Lang. Comb. (2025). arXiv:2512.11007. https:\/\/doi.org\/10.48550\/arXiv.2512.11007","DOI":"10.48550\/arXiv.2512.11007"},{"issue":"6","key":"24_CR9","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1142\/S0129054113400170","volume":"24","author":"FM Fominykh","year":"2013","unstructured":"Fominykh, F.M., Martyugin, P.V., Volkov, M.V.: P(l)aying for synchronization. Int. J. Found. Comput. Sci. 24(6), 765\u2013780 (2013). https:\/\/doi.org\/10.1142\/S0129054113400170","journal-title":"Int. J. Found. Comput. Sci."},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Fominykh, F., Volkov, M.: P(l)aying for synchronization. In: Moreira, N., Reis, R., (eds.) Implementation and Application of Automata (CIAA 2012), Lect. Notes Comput. Sci. vol.\u00a07381, pp.\u00a0159\u2013170. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_14","DOI":"10.1007\/978-3-642-31606-7_14"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Green, J.A.: On the structure of semigroups. Ann. Math. (2) 54(1), 163\u2013172 (1951). https:\/\/doi.org\/10.2307\/1969317","DOI":"10.2307\/1969317"},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Kari, J., Volkov, M.: \u010cern\u00fd\u2019s conjecture and the road colouring problem. In: Pin, J.-E., (ed.) Handbook of Automata Theory, vol. I, pp. 525\u2013565. EMS Press, Z\u00fcrich (2021). https:\/\/doi.org\/10.4171\/AUTOMATA-1\/15","DOI":"10.4171\/AUTOMATA-1\/15"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Lipin, A.E., Volkov, M.V.: Adversarial synchronization (2026). arXiv:2601.18362. https:\/\/doi.org\/10.48550\/arXiv.2601.18362","DOI":"10.48550\/arXiv.2601.18362"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.entcs.2018.06.006","volume":"339","author":"JA Montoya","year":"2018","unstructured":"Montoya, J.A., Nolasco, C.: Some remarks on synchronization, games and planar automata. Electron. Notes Theor. Comput. Sci. 339, 85\u201397 (2018). https:\/\/doi.org\/10.1016\/j.entcs.2018.06.006","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"5","key":"24_CR15","doi-asserted-by":"publisher","first-page":"819","DOI":"10.4213\/rm10005e","volume":"77","author":"MV Volkov","year":"2022","unstructured":"Volkov, M.V.: Synchronization of finite automata. Russ. Math. Surv. 77(5), 819\u2013891 (2022). https:\/\/doi.org\/10.4213\/rm10005e","journal-title":"Russ. Math. Surv."},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Volkov, M.V.: List of results on the \u010cern\u00fd conjecture and reset thresholds for synchronizing automata (2025). arXiv:2508.15655. https:\/\/doi.org\/10.48550\/arXiv.2508.15655","DOI":"10.48550\/arXiv.2508.15655"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:28:52Z","timestamp":1784482132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}