{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:22:07Z","timestamp":1747153327684,"version":"3.40.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331794"},{"type":"electronic","value":"9783031331800"}],"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-33180-0_8","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"104-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sturmian and\u00a0Infinitely Desubstitutable Words Accepted by\u00a0an\u00a0$$\\omega $$-Automaton"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4050-7709","authenticated-orcid":false,"given":"Pierre","family":"B\u00e9aur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5194-929X","authenticated-orcid":false,"given":"Benjamin","family":"Hellouin de Menibus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Arnoux, P., Rauzy, G.: Repr\u00e9sentation g\u00e9om\u00e9trique de suites de complexit\u00e9 2n+1. Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France 119(2), 199\u2013215 (1991). https:\/\/doi.org\/10.24033\/bsmf.2164","DOI":"10.24033\/bsmf.2164"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bassino, F., David, J., Sportiello, A.: Asymptotic enumeration of minimal automata. In: D\u00fcrr, C., Wilke, T. (eds.) 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14, pp. 88\u201399. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2012). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2012.88","DOI":"10.4230\/LIPIcs.STACS.2012.88"},{"key":"8_CR3","unstructured":"Berstel, J.: Axel Thue\u2019s papers on repetitions in words: a translation. In: Monographies du LaCIM, vol. 11, pp. 65\u201380. LaCIM (1992). https:\/\/hal.science\/hal-00620702"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.4064\/aa122-4-1","volume":"122","author":"V Berth\u00e9","year":"2006","unstructured":"Berth\u00e9, V., Holton, C., Zamboni, L.Q.: Initial powers of sturmian sequences. Acta Arithmetica 122, 315\u2013347 (2006). https:\/\/doi.org\/10.4064\/aa122-4-1","journal-title":"Acta Arithmetica"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/inco.2001.3139","volume":"176","author":"O Carton","year":"2002","unstructured":"Carton, O., Thomas, W.: The monadic theory of morphic infinite words and generalizations. Inf. Comput. 176(1), 51\u201365 (2002). https:\/\/doi.org\/10.1006\/inco.2001.3139","journal-title":"Inf. Comput."},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1017\/S0143385700009032","volume":"16","author":"S Ferenczi","year":"1996","unstructured":"Ferenczi, S.: Rank and symbolic complexity. Ergodic Theor. Dyn. Syst. 16(4), 663\u2013682 (1996). https:\/\/doi.org\/10.1017\/S0143385700009032","journal-title":"Ergodic Theor. Dyn. Syst."},{"key":"8_CR7","unstructured":"Gheeraert, F., Lejeune, M., Leroy, J.: S-adic characterization of minimal ternary dendric subshifts. CoRR abs\/2102.10092 (2021). https:\/\/arxiv.org\/abs\/2102.10092"},{"key":"8_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"D Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995). https:\/\/doi.org\/10.1017\/CBO9780511626302"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Sturmian words. In: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 2, pp. 45\u2013110. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9781107326019.003","DOI":"10.1017\/CBO9781107326019.003"},{"key":"8_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/S0079-8169(04)80002-3","volume-title":"Infinite Words, Pure and Applied Mathematics","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words, Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004). https:\/\/doi.org\/10.1016\/S0079-8169(04)80002-3"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2011.12.047","volume":"429","author":"D Perrin","year":"2012","unstructured":"Perrin, D., Restivo, A.: A note on sturmian words. Theor. Comput. Sci. 429, 265\u2013272 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.047","journal-title":"Theor. Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Pytheas Fogg, N., Berth\u00e9, V., Ferenczi, S., Mauduit, C., Siegel, A.: Sturmian sequences. In: Substitutions in Dynamics, Arithmetics and Combinatorics, vol. 6, pp. 143\u2013198. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45714-3_6","DOI":"10.1007\/3-540-45714-3_6"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2021.01.004","volume":"857","author":"G Richomme","year":"2021","unstructured":"Richomme, G.: On sets of indefinitely desubstitutable words. Theor. Comput. Sci. 857, 97\u2013113 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.004","journal-title":"Theor. Comput. Sci."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.jcss.2017.05.017","volume":"89","author":"V Salo","year":"2017","unstructured":"Salo, V.: Decidability and universality of quasiminimal subshifts. J. Comput. Syst. Sci. 89, 288\u2013314 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.05.017","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR16","unstructured":"Salo, V.: Notes and errata on Decidability and Universality of Quasiminimal Subshifts (2022). https:\/\/villesalo.com\/notes\/DaUoQSNotes.html"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Thomas, W.: Handbook of Formal Languages: Volume 3 Beyond Words. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6","DOI":"10.1007\/978-3-642-59126-6"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33180-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:04:30Z","timestamp":1685487870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_8","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":"31 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","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":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"68% - 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":"2.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":"5","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":"3 Invited papers included in this proceedings","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)"}}]}}