{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:38Z","timestamp":1725577418605},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_17","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"154-162","source":"Crossref","is-referenced-by-count":11,"title":["Approximating Minimum Reset Sequences"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gerbush","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brent","family":"Heeringa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: FOCS, pp. 132\u2013142 (1986)","DOI":"10.1109\/SFCS.1986.5"},{"issue":"2","key":"17_CR2","first-page":"332","volume":"8","author":"A. Salomaa","year":"2002","unstructured":"Salomaa, A.: Generation of constants and synchronization of finite automata. J. UCS\u00a08(2), 332\u2013347 (2002)","journal-title":"J. UCS"},{"issue":"3","key":"17_CR3","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. Computing\u00a019(3), 500\u2013510 (1990)","journal-title":"SIAM J. Computing"},{"key":"17_CR4","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Poznamka k homogenym eksperimentom s konechnymi automatami. Math.-Fyz. \u010cas\u00a014, 208\u2013215 (1964)","journal-title":"Math.-Fyz. \u010cas"},{"key":"17_CR5","first-page":"535","volume":"17","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics\u00a017, 535\u2013548 (1983)","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"17_CR6","first-page":"165","volume":"23","author":"A.A. Klyachko","year":"1987","unstructured":"Klyachko, A.A., Rystsov, I.K., Spivak, M.A.: In extremal combinatorial problem associated with the length of a synchronizing word in an automaton. Cybernetics and Systems Analysis\u00a023(2), 165\u2013171 (1987)","journal-title":"Cybernetics and Systems Analysis"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"D. Ananichev","year":"2005","unstructured":"Ananichev, D., Volkov, M.: Synchronizing generalized monotonic automata. Theoretical Computer Science\u00a0330(1), 3\u201313 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on eulerian digraphs. Theoretical Computer Science\u00a0295(1-3), 223\u2013232 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.V. Berlinkov","year":"2010","unstructured":"Berlinkov, M.V.: On calculating length of minimal synchronizing words. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, Springer, Heidelberg (2010); CoRR abs\/0909.3787"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Olschewski, J., Ummels, M.: The Complexity of Finding Reset Words in Finite Automata. CoRR abs\/1004.3246v1 (April 2010)","DOI":"10.1007\/978-3-642-15155-2_50"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput.\u00a024(5), 1122\u20131139 (1995)","journal-title":"SIAM J. Comput."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms\u00a02, 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR13","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-18098-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T09:57:55Z","timestamp":1637229475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}