{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:37Z","timestamp":1771024237161,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031074684","type":"print"},{"value":"9783031074691","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_8","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"106-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Some Results Concerning Careful Synchronization of\u00a0Partial Automata and\u00a0Subset Synchronization of\u00a0DFA\u2019s"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0659-2575","authenticated-orcid":false,"given":"Jakub","family":"Ruszil","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"8_CR1","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":"8_CR2","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ins.2016.07.049","volume":"369","author":"M Berlinkov","year":"2016","unstructured":"Berlinkov, M., Szyku\u0142a, M.: Algebraic synchronization criterion and computing reset words. Inf. Sci. 369, 718\u2013730 (2016)","journal-title":"Inf. Sci."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Berlinkov, M.V., Ferens, R., Ryzhikov, A., Szyku\u0142a, M.: Synchronizing strongly connected partial DFAs. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 187, pp. 12:1\u201312:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.12. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13657","DOI":"10.4230\/LIPIcs.STACS.2021.12"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Berlinkov, M.V., Ferens, R., Szyku\u0142a, M.: Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115, 214\u2013234 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.08.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000020300805","DOI":"10.1016\/j.jcss.2020.08.002"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1016\/j.tcs.2009.06.005","volume":"410","author":"MT Biskup","year":"2009","unstructured":"Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theoret. Comput. Sci. 410, 3925\u20133941 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"de Bondt, M., Don, H., Zantema, H.: Lower bounds for synchronizing word lengths in partial automata. Int. J. Found. Comput. Sci. 30, 29\u201360 (2019)","DOI":"10.1142\/S0129054119400021"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Don, H.: The \u010cern\u00fd conjecture and 1-contracting automata. Electron. J. Comb. 23 (2016)","DOI":"10.37236\/5616"},{"key":"8_CR8","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, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Gonze, F., Jungers, R.M.: Hardly reachable subsets and completely reachable automata with 1-deficient words. J. Automata Lang. Comb. 24(2\u20134), 321\u2013342 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-321","DOI":"10.25596\/jalc-2019-321"},{"key":"8_CR10","first-page":"105","volume":"14","author":"B Imreh","year":"1999","unstructured":"Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybern. 14, 105\u2013115 (1999)","journal-title":"Acta Cybern."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen, H.: Synchronization. Inf. Comput. 206, 1033\u20131044 (2008)","DOI":"10.1016\/j.ic.2008.03.005"},{"key":"8_CR12","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing word in finite. EATCS Bull. 73, 146\u2013147 (2001)","journal-title":"EATCS Bull."},{"key":"8_CR13","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. Theoret. Comput. Sci. 295, 223\u2013232 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR14","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":"8_CR15","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: The complexity of synchronizing Markov decision processes. J. Comput. Syst. Sci. 100, 96\u2013129 (2019)","DOI":"10.1016\/j.jcss.2018.09.004"},{"key":"8_CR16","unstructured":"Landau, E.: \u00dcber die maximalordnung der permutationen gegebenen grades. Arch. Math. Phys. 3 (1903)"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Martyugin, P.: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata. Theory Comput. Syst. 54, 293\u2013304 (2014). https:\/\/doi.org\/10.1007\/s00224-013-9516-6","DOI":"10.1007\/s00224-013-9516-6"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"P Martyugin","year":"2010","unstructured":"Martyugin, P.: A lower bound for the length of the shortest carefully synchronizing words. Russ. Math. 54, 46\u201354 (2010)","journal-title":"Russ. Math."},{"key":"8_CR19","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":"8_CR20","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":"8_CR21","doi-asserted-by":"crossref","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: 27th Annual Symposium on Foundations of Computer Science, pp. 132\u2013142 (1986)","DOI":"10.1109\/SFCS.1986.5"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. In: Proceedings of the International Colloquium on Graph Theory and Combinatorics, vol. 75, pp. 535\u2013548 (1983)","DOI":"10.1016\/S0304-0208(08)73432-7"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BF01069104","volume":"16","author":"IK Rystsov","year":"1980","unstructured":"Rystsov, I.K.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybernetics 16, 194\u2013198 (1980)","journal-title":"Cybernetics"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"IK Rystsov","year":"1997","unstructured":"Rystsov, I.K.: Reset words for commutative and solvable automata. Theoret. Comput. Sci. 172, 273\u2013279 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR25","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":"8_CR26","unstructured":"Szyku\u0142a, M.: Improving the upper bound on the length of the shortest reset word. In: STACS 2018, pp. 56:1\u201356:13 (2018)"},{"key":"8_CR27","first-page":"3","volume":"9","author":"A Trahtman","year":"2007","unstructured":"Trahtman, A.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci. 9, 3\u201310 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"8_CR28","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":"8_CR29","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume":"5196","author":"M Volkov","year":"2008","unstructured":"Volkov, M.: Synchronizing automata and the \u010cern\u00fd conjecture. Lang. Automata Theor. Appl. 5196, 11\u201327 (2008)","journal-title":"Lang. Automata Theor. Appl."},{"key":"8_CR30","first-page":"375","volume":"24","author":"M Volkov","year":"2019","unstructured":"Volkov, M.: Slowly synchronizing automata with idempotent letters of low rank. J. Autom. Lang. Comb. 24, 375\u2013386 (2019)","journal-title":"J. Autom. Lang. Comb."},{"key":"8_CR31","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. Jour. Found. Comput. Sci. 27, 557\u2013578 (2016)","journal-title":"Jour. Found. Comput. Sci."},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Gazdag, Z., Ivan, I., Nagy-Gyorgy, J.: Improved upper bounds on synchronizing nondeterministic automata. Inf. Processi. Lett. 109, 986\u2013990 (2009)","DOI":"10.1016\/j.ipl.2009.05.007"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07469-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:05:54Z","timestamp":1655766354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}