{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:10:31Z","timestamp":1784527831251,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316050","type":"print"},{"value":"9783642316067","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_14","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T03:47:55Z","timestamp":1345866475000},"page":"159-170","source":"Crossref","is-referenced-by-count":4,"title":["P(l)aying for Synchronization"],"prefix":"10.1007","author":[{"given":"Fedor","family":"Fominykh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci.\u00a0376, 30\u201341 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","unstructured":"B\u00e9al, M.-P., Perrin, D.: A quadratic algorithm for road coloring. Technical report, Universit\u00e9 Paris-Est (2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0803.0726"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11759744_3","volume-title":"Formal Approaches to Software Testing","author":"A. Blass","year":"2006","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., Veanes, M.: Play to Test. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol.\u00a03997, pp. 32\u201346. Springer, Heidelberg (2006)"},{"issue":"3","key":"14_CR4","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014(3), 208\u2013216 (1964) (in Slovak)","journal-title":"Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied"},{"key":"14_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, McGraw-Hill, Cambridge (2009)","edition":"3"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D. Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-13182-0_27","volume-title":"Computer Science \u2013 Theory and Applications","author":"P.V. Martyugin","year":"2010","unstructured":"Martyugin, P.V.: Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 288\u2013302. Springer, Heidelberg (2010)"},{"key":"14_CR8","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/PGEC.1963.263534","volume":"12","author":"M. Perles","year":"1963","unstructured":"Perles, M., Rabin, M.O., Shamir, E.: The theory of definite automata. IEEE Trans. Electronic Comput.\u00a012, 233\u2013243 (1963)","journal-title":"IEEE Trans. Electronic Comput."},{"key":"14_CR10","first-page":"535","volume":"17","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"14_CR11","unstructured":"Rystsov, I.K.: On minimizing length of synchronizing words for finite automata. In: Theory of Designing of Computing Systems, pp. 75\u201382. Institute of Cybernetics of Ukrainian Acad. Sci. (1980) (in Russian)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2005","unstructured":"Sandberg, S.: Homing and Synchronizing Sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","volume":"172","author":"A. Trahtman","year":"2009","unstructured":"Trahtman, A.: The Road Coloring Problem. Israel J. Math.\u00a0172(1), 51\u201360 (2009)","journal-title":"Israel J. Math."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-22953-4_15","volume-title":"Fundamentals of Computation Theory","author":"A.N. Trahtman","year":"2011","unstructured":"Trahtman, A.N.: Modifying the Upper Bound on the Length of Minimal Synchronizing Word. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 173\u2013180. Springer, Heidelberg (2011)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing Automata and the \u010cern\u00fd Conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:39:56Z","timestamp":1620113996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}