{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:34Z","timestamp":1740099034933,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77313-1_7","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:20:49Z","timestamp":1520371249000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Synchronization of Planar Automata"],"prefix":"10.1007","author":[{"given":"J.","family":"Andres Montoya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Nolasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15155-2_7","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D Ananichev","year":"2010","unstructured":"Ananichev, D., Gusev, V., Volkov, M.: Slowly synchronizing automata and digraphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55\u201365. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15155-2_7"},{"issue":"2","key":"7_CR2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"R Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.: Searching subsequences. Theor. Comput. Sci. 78(2), 363\u2013376 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-09698-8_6","volume-title":"Developments in Language Theory","author":"MV Berlinkov","year":"2014","unstructured":"Berlinkov, M.V.: On two algorithmic problems about synchronizing automata. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 61\u201367. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09698-8_6"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00263745","volume":"6","author":"R Book","year":"1976","unstructured":"Book, R., Chandra, A.: Inherently nonplanar automata. Acta Inf. 6, 89\u201394 (1976)","journal-title":"Acta Inf."},{"key":"7_CR5","first-page":"208","volume":"14","author":"J \u010cerny","year":"1964","unstructured":"\u010cerny, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s konecnymi automatmi. Mat. fyz. cas SAV 14, 208\u2013215 (1964)","journal-title":"Mat. fyz. cas SAV"},{"key":"7_CR6","doi-asserted-by":"crossref","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. 19, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-662-48057-1_19","volume-title":"Mathematical Foundations of Computer Science 2015","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Straszak, D.: Strong inapproximability of the shortest reset word. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 243\u2013255. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48057-1_19"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.disopt.2010.08.003","volume":"8","author":"S Guillemot","year":"2011","unstructured":"Guillemot, S.: Parameterized complexity and approximability of the longest compatible sequence problem. Discret. Optim. 8(1), 50\u201360 (2011)","journal-title":"Discret. Optim."},{"issue":"44","key":"7_CR10","first-page":"2151","volume":"11","author":"J Montoya","year":"2017","unstructured":"Montoya, J., Nolasco, C.: On the synchronization of small sets of states. Appl. Math. Sci. 11(44), 2151\u20132173 (2017)","journal-title":"Appl. Math. Sci."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-15155-2_50","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Olschewski","year":"2010","unstructured":"Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568\u2013579. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15155-2_50"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:24:05Z","timestamp":1520371445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}