{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:36Z","timestamp":1771024236466,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385353","type":"print"},{"value":"9783642385360","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_7","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"76-87","source":"Crossref","is-referenced-by-count":8,"title":["Careful Synchronization of Partial Automata with Restricted Alphabets"],"prefix":"10.1007","author":[{"given":"Pavel V.","family":"Martyugin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2004.03.068","volume":"327","author":"D.S. Ananichev","year":"2004","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. Theoret. Comput. Sci.\u00a0327, 225\u2013239 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR2","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Mat.-Fyz. Cas. Slovensk. Akad. Vied.\u00a014, 208\u2013216 (1964) (in Slovak)","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"7_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. Comput.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"issue":"17","key":"7_CR4","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1016\/j.ipl.2009.05.007","volume":"109","author":"Z. Gazdag","year":"2009","unstructured":"Gazdag, Z., Ivan, S., Nagy-Gyorgy, J.: Improved upper bounds on synchronizing nondeterministic automata. Information Processing Letters\u00a0109(17), 986\u2013990 (2009)","journal-title":"Information Processing Letters"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44683-4_38","volume-title":"Mathematical Foundations of Computer Science 2001","author":"J. Kari","year":"2001","unstructured":"Kari, J.: Synchronizing finite automata on eulerian digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 432\u2013438. Springer, Heidelberg (2001)"},{"key":"7_CR6","first-page":"105","volume":"14","author":"B. Imreh","year":"1999","unstructured":"Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybernetica\u00a014, 105\u2013115 (1999)","journal-title":"Acta Cybernetica"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-27812-2_12","volume-title":"Theory Is Forever","author":"M. Ito","year":"2004","unstructured":"Ito, M., Shikishima-Tsuji, K.: Some results on directable automata. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol.\u00a03113, pp. 125\u2013133. Springer, Heidelberg (2004)"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/4791","volume-title":"Algebraic Theory of Automata and Languages","author":"M. Ito","year":"2004","unstructured":"Ito, M.: Algebraic Theory of Automata and Languages. World Scientific, Singapore (2004)"},{"issue":"4","key":"7_CR9","first-page":"44","volume":"15","author":"P.V. Martyugin","year":"2008","unstructured":"Martyugin, P.V.: Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata. Diskretn. Anal. Issled. Oper.\u00a015(4), 44\u201356 (2008)","journal-title":"Diskretn. Anal. Issled. Oper."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"P.V. Martyugin","year":"2010","unstructured":"Martyugin, P.V.: A Lower Bound for the Length of the Shortest Carefully Synchronizing Words. Russian Mathematics (Iz. VUZ)\u00a054(1), 46\u201354 (2010)","journal-title":"Russian Mathematics (Iz. VUZ)"},{"key":"7_CR11","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":"7_CR12","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)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.tcs.2009.03.021","volume":"410","author":"M.V. Volkov","year":"2009","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci.\u00a0410, 3513\u20133519 (2009)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:25:23Z","timestamp":1557764723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}