{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:27:44Z","timestamp":1743042464181,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031661587"},{"type":"electronic","value":"9783031661594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_18","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"252-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Careful Synchronization of\u00a0One-Cluster Automata"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Ruszil","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054111008039","volume":"22","author":"M-P B\u00e9al","year":"2011","unstructured":"B\u00e9al, M.-P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22(2), 277\u2013288 (2011). https:\/\/doi.org\/10.1142\/S0129054111008039","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR2","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). https:\/\/doi.org\/10.1007\/978-3-319-09698-8_6"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Berlinkov, M.V., Ferens, R., Ryzhikov, A., Szyku, M.:? Synchronizing strongly connected partial DFAs. In: Bl\u00e4ser, M., Monmege, B. (eds.), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u201319 March 2021, Saarbr\u00fccken, Germany (Virtual Conference), volume 187 of LIPIcs, pp. 12:1\u201312:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.12, https:\/\/doi.org\/10.4230\/LIPICS.STACS.2021.12.","DOI":"10.4230\/LIPIcs.STACS.2021.12 10.4230\/LIPICS.STACS.2021.12."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ins.2016.07.049","volume":"3690","author":"MV Berlinkov","year":"2016","unstructured":"Berlinkov, M.V., Szyku, M.: Algebraic synchronization criterion and computing reset words. Inf. Sci. 3690, 718\u2013730 (2016). https:\/\/doi.org\/10.1016\/j.ins.2016.07.049","journal-title":"Inf. Sci."},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38-40), 3925\u20133941 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.06.005,","DOI":"10.1016\/j.tcs.2009.06.005"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1142\/S0129054119400021","volume":"30","author":"M de Bondt","year":"2019","unstructured":"de Bondt, M., Don, H., Zantema, H.: Lower bounds for synchronizing word lengths in partial automata. Int. J. Found. Comput. Sci. 30(1), 29\u201360 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-44584-6_17","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"L Doyen","year":"2014","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Robust synchronization in markov decision processes. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 234\u2013248. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_17"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: The complexity of synchronizing Markov decision processes. J. Comput. Syst. Sci. 100, 96\u2013129 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2018.09.004","DOI":"10.1016\/j.jcss.2018.09.004"},{"issue":"3","key":"18_CR9","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. 19(3), 500\u2013510 (1990). https:\/\/doi.org\/10.1137\/0219033","journal-title":"SIAM J. Comput."},{"issue":"17","key":"18_CR10","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., Iv\u00e1n, S., Nagy-Gy\u00f6rgy, J.: Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109(17), 986\u2013990 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.05.007","journal-title":"Inf. Process. Lett."},{"key":"18_CR11","unstructured":"Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybern. 14(1), 105\u2013115 (1999). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3514"},{"key":"18_CR12","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. 3113, pp. 125\u2013133. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27812-2_12"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"J\u00fcrgensen, H.: Synchronization. Inf. Comput. 206(9-10), 1033\u20131044 (2008). https:\/\/doi.org\/10.1016\/J.IC.2008.03.005","DOI":"10.1016\/J.IC.2008.03.005"},{"key":"18_CR14","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. Bull. EATCS 73, 146 (2001)","journal-title":"Bull. EATCS"},{"key":"18_CR15","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. Theor. Comput. Sci. 295, 223\u2013232 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00405-X","journal-title":"Theor. Comput. Sci."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"PV Martyugin","year":"2010","unstructured":"Martyugin, P.V.: A lower bound for the length of the shortest carefully synchronizing words. Russian Math. 54, 46\u201354 (2010)","journal-title":"Russian Math."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38536-0_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"PV Martyugin","year":"2013","unstructured":"Martyugin, P.V.: Careful synchronization of partial automata with restricted alphabets. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 76\u201387. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_7"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Martyugin, P.V.: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata. Theory Comput. Syst. 54(2), 293\u2013304 (2014). https:\/\/doi.org\/10.1007\/s00224-013-9516-6","DOI":"10.1007\/s00224-013-9516-6"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts Orienters. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pp. 132\u2013142. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.5","DOI":"10.1109\/SFCS.1986.5"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Pin, J.: On two combinatorial problems arising from automata theory. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Combinatorial Mathematics, volume\u00a075 of North-Holland Mathematics Studies, pp. 535\u2013548. North-Holland (1983). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304020808734327, https:\/\/doi.org\/10.1016\/S0304-0208(08)73432-7","DOI":"10.1016\/S0304-0208(08)73432-7"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BF01069104","volume":"16","author":"I Rystsov","year":"1980","unstructured":"Rystsov, I.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybernetics 16, 194\u2013198 (1980)","journal-title":"Cybernetics"},{"issue":"1\u20132","key":"18_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I Rystsov","year":"1997","unstructured":"Rystsov, I.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172(1\u20132), 273\u2013279 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00136-3","journal-title":"Theor. Comput. Sci."},{"key":"18_CR23","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.: 1 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. 3472, pp. 5\u201333. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11498490_2"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487\u20135491 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.06.012","DOI":"10.1016\/j.tcs.2011.06.012"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Szyku\u0142a, M.: Improving the upper bound on the length of the shortest reset word. In: Niedermeier, R., Vall\u00e9e, B. (eds.) 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, volume\u00a096 of LIPIcs, pp. 56:1\u201356:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.56","DOI":"10.4230\/LIPIcs.STACS.2018.56"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Trahtman, A.: The \u010cern\u00fd conjecture for aperiodic automata. Discret. Math. Theor. Comput. Sci. 9(2) (2007). https:\/\/doi.org\/10.46298\/dmtcs.395","DOI":"10.46298\/dmtcs.395"},{"key":"18_CR27","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. Mat.-Fyz. Cas. Slovens. Akad. Vied. 14, 208\u2013216 (1964)","journal-title":"Mat.-Fyz. Cas. Slovens. Akad. Vied."},{"key":"18_CR28","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":"MV 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. 5196, pp. 11\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Volkov, M.V.: Slowly synchronizing automata with idempotent letters of low rank. J. Autom. Lang. Comb. 24(2-4):375\u2013386 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-375","DOI":"10.25596\/jalc-2019-375"},{"issue":"5","key":"18_CR30","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0129054116500167","volume":"27","author":"V Vorel","year":"2016","unstructured":"Vorel, V.: Subset synchronization and careful synchronization of binary finite automata. Int. J. Found. Comput. Sci. 27(5), 557\u2013578 (2016). https:\/\/doi.org\/10.1142\/S0129054116500167","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:47Z","timestamp":1729325027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}