{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:29Z","timestamp":1742912609094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_17","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"208-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synchronizing Automata with\u00a0Coinciding Cycles"],"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":[[2023,5,19]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2006.02.003","volume":"359","author":"F Arnold","year":"2006","unstructured":"Arnold, F., Steinberg, B.: Synchronizing groups and automata. Theor. Comput. Sci. 359(1), 101\u2013110 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"17_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":"17_CR3","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":"17_CR4","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. Theor. Comput. Sci. 410, 3925\u20133941 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR5","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":"17_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jcss.2018.09.004","volume":"100","author":"L Doyen","year":"2019","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: The complexity of synchronizing Markov decision processes. J. Comput. Syst. Sci. 100, 96\u2013129 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"17_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Theor. Inf. Appl. 32(1\u20133), 21\u201334 (1998)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"17_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. of Comput. 19, 500\u2013510 (1990)","journal-title":"SIAM J. of Comput."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-62809-7_13","volume-title":"Developments in Language Theory","author":"F Gonze","year":"2017","unstructured":"Gonze, F., Gusev, V.V., Gerencs\u00e9r, B., Jungers, R.M., Volkov, M.V.: On the interplay between Babai and \u010cern\u00fd\u2019s conjectures. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) Developments in Language Theory, pp. 185\u2013197. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_13"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1142\/S0129054115400080","volume-title":"Implementation and Application of Automata","author":"VV Gusev","year":"2014","unstructured":"Gusev, V.V., Pribavkina, E.V.: Reset thresholds of automata with two cycle lengths. In: Holzer, M., Kutrib, M. (eds.) Implementation and Application of Automata, pp. 200\u2013210. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1142\/S0129054115400080"},{"key":"17_CR11","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":"17_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":"17_CR13","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.ic.2008.03.005","volume":"206","author":"H J\u00fcrgensen","year":"2008","unstructured":"J\u00fcrgensen, H.: Synchronization. Inf. Comput. 206, 1033\u20131044 (2008)","journal-title":"Inf. Comput."},{"key":"17_CR14","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing word in finite automata. EATCS Bull. 73, 146\u2013147 (2001)","journal-title":"EATCS Bull."},{"key":"17_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)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR16","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":"17_CR17","first-page":"535","volume":"75","author":"JE Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Proc. Int. Colloquium Graph Theory Comb. 75, 535\u2013548 (1983)","journal-title":"Proc. Int. Colloquium Graph Theory Comb."},{"key":"17_CR18","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. Theor. Comput. Sci. 172, 273\u2013279 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume":"3472","author":"S Sandberg","year":"2005","unstructured":"Sandberg, S.: Homing and synchronizing sequences. Model-Based Test. React. Syst. 3472, 5\u201333 (2005)","journal-title":"Model-Based Test. React. Syst."},{"issue":"39","key":"17_CR20","doi-asserted-by":"publisher","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","volume":"412","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR21","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":"17_CR22","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":"17_CR23","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":"17_CR24","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 Theory Appl. 5196, 11\u201327 (2008)","journal-title":"Lang. Automata Theory Appl."},{"key":"17_CR25","first-page":"375","volume":"24","author":"M Volkov","year":"2019","unstructured":"Volkov, M.: Slowly synchronizing automata with idempotent letters of low rank. J. Automata, Lang. Comb. 24, 375\u2013386 (2019)","journal-title":"J. Automata, Lang. Comb."}],"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-33264-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:05:59Z","timestamp":1684397159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","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":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"0","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":"59% - 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":"6","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)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}