{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:40:34Z","timestamp":1742938834749,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_20","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"282-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Around Don\u2019s Conjecture for\u00a0Binary Completely Reachable Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1724-5250","authenticated-orcid":false,"given":"Yinfeng","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-41114-9_1","volume-title":"Descriptional Complexity of Formal Systems","author":"EA Bondar","year":"2016","unstructured":"Bondar, E.A., Volkov, M.V.: Completely reachable automata. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 1\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_1"},{"key":"20_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-031-20624-5_21","volume-title":"LATIN 2022: Theoretical Informatics","author":"D Casas","year":"2022","unstructured":"Casas, D., Volkov, M.V.: Binary completely reachable automata. In: Casta\u00f1eda, A., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATIN 2022. LNCS, vol. 13568, pp. 345\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_21"},{"key":"20_CR3","unstructured":"Casas, D., Volkov, M.V.: Don\u2019s conjecture for binary completely reachable automata: an approach and its limitations (2023). https:\/\/arxiv.org\/abs\/2311.00077"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Don, H.: The \u010cern\u00fd conjecture and 1-contracting automata. Electron. J. Combin. 23(3), Paper 3.12, 10 (2016). https:\/\/doi.org\/10.37236\/5616","DOI":"10.37236\/5616"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Ferens, R., Szyku\u0142a, M.: Completely reachable automata: a polynomial algorithm and quadratic upper bounds. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0261, pp. 59:1\u201359:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.59","DOI":"10.4230\/LIPIcs.ICALP.2023.59"},{"key":"20_CR6","unstructured":"Ferens, R., Szyku\u0142a, M.: A polynomial algorithm deciding the complete reachability and quadratic reaching thresholds. https:\/\/arxiv.org\/abs\/2208.05956"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Gonze, F., Jungers, R.M.: Hardly reachable subsets and completely reachable automata with 1-deficient words. J. Autom. Lang. Comb. 24(2-4), 321\u2013342 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-321","DOI":"10.25596\/jalc-2019-321"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Kari, J., Volkov, M.V.: \u010cern\u00fd\u2019s conjecture and the road colouring problem. In: Pin, J.-\u00c9 (ed.) Handbook of Automata Theory. Vol. I. Theoretical Foundations, pp. 525\u2013565. EMS Press, Berlin (2021).https:\/\/doi.org\/10.4171\/AUTOMATA-1\/15","DOI":"10.4171\/AUTOMATA-1\/15"},{"key":"20_CR9","unstructured":"Maslennikova, M.I.: Reset complexity of ideal languages. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., \u0160p\u00e1nek, R., Tur\u00e1n II, G. (eds.) SOFSEM 2012, pp. 33\u201334. Institute of Computer Science Academy of Sciences of the Czech Republic (2012). http:\/\/arxiv.org\/abs\/1404.2816"},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"819","DOI":"10.4213\/rm10005e","volume":"77","author":"MV Volkov","year":"2022","unstructured":"Volkov, M.V.: Synchronization of finite automata. Russ. Math. Surv. 77(5), 819\u2013891 (2022). https:\/\/doi.org\/10.4213\/rm10005e","journal-title":"Russ. Math. Surv."}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:04:10Z","timestamp":1729325050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_20","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"}}]}}