{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:26:25Z","timestamp":1743150385517,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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_6","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"77-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Substitutions Preserving Their Return Sets"],"prefix":"10.1007","author":[{"given":"Val\u00e9rie","family":"Berth\u00e9","sequence":"first","affiliation":[]},{"given":"Herman","family":"Goulet-Ouellet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Almeida, J.: Profinite groups associated with weakly primitive substitutions. J. Math. Sci. 144(2), 3881\u20133903 (2007). https:\/\/doi.org\/10.1007\/s10958-007-0242-y, translated from Fundam. Prikl. Mat., 11(3), 13\u201348 (2005)","DOI":"10.1007\/s10958-007-0242-y,"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11856-012-0139-4","volume":"196","author":"J Almeida","year":"2013","unstructured":"Almeida, J., Costa, A.: Presentations of Sch\u00fctzenberger groups of minimal subshifts. Israel J. Math. 196(1), 1\u201331 (2013). https:\/\/doi.org\/10.1007\/s11856-012-0139-4","journal-title":"Israel J. Math."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11512-016-0233-7","volume":"54","author":"J Almeida","year":"2016","unstructured":"Almeida, J., Costa, A.: A geometric interpretation of the Sch\u00fctzenberger group of a minimal subshift. Ark. Math. 54(2), 243\u2013275 (2016). https:\/\/doi.org\/10.1007\/s11512-016-0233-7","journal-title":"Ark. Math."},{"issue":"3\u20134","key":"6_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00605-008-0001-2","volume":"155","author":"L Balkov\u00e1","year":"2008","unstructured":"Balkov\u00e1, L., Pelantov\u00e1, E., Steiner, W.: Sequences with constant number of return words. Monatsh. Math. 155(3\u20134), 251\u2013263 (2008). https:\/\/doi.org\/10.1007\/s00605-008-0001-2","journal-title":"Monatsh. Math."},{"issue":"3\u20134","key":"6_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1051\/ita\/1994283-402551","volume":"28","author":"J Berstel","year":"1994","unstructured":"Berstel, J., S\u00e9\u00e9bold, P.: A remark on morphic Sturmian words. RAIRO - Theor. Inform. Appl. 28(3\u20134), 255\u2013263 (1994). https:\/\/doi.org\/10.1051\/ita\/1994283-402551","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jalgebra.2012.07.013","volume":"369","author":"J Berstel","year":"2012","unstructured":"Berstel, J., De Felice, C., Perrin, D., Reutenauer, C., Rindone, G.: Bifix codes and Sturmian words. J. Algebra 369, 146\u2013202 (2012). https:\/\/doi.org\/10.1016\/j.jalgebra.2012.07.013","journal-title":"J. Algebra"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/cbo9781139195768","DOI":"10.1017\/cbo9781139195768"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Berstel, J., S\u00e9\u00e9bold, P.: A characterization of Sturmian morphisms. In: Borzyszkowski, A., Soko\u0142owski, S. (eds.) Lecture Notes in Computer Science, vol. 711, pp. 281\u2013290. Springer, Berlin Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_20","DOI":"10.1007\/3-540-57182-5_20"},{"issue":"05","key":"6_CR9","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1142\/S0129054118420017","volume":"29","author":"V Berth\u00e9","year":"2018","unstructured":"Berth\u00e9, V., Dolce, F., Durand, F., Leroy, J., Perrin, D.: Rigidity and substitutive dendric words. Int. J. Found. Comput. 29(05), 705\u2013720 (2018). https:\/\/doi.org\/10.1142\/S0129054118420017","journal-title":"Int. J. Found. Comput."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","volume":"176","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., et al.: Acyclic, connected and tree sets. Monatsh. Math. 176(4), 521\u2013550 (2015). https:\/\/doi.org\/10.1007\/s00605-014-0721-4","journal-title":"Monatsh. Math."},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.disc.2014.12.010","volume":"338","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., et al.: Maximal bifix decoding. Discrete Math. 338(5), 725\u2013742 (2015). https:\/\/doi.org\/10.1016\/j.disc.2014.12.010","journal-title":"Discrete Math."},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1142\/s0218196706003232","volume":"16","author":"A Costa","year":"2006","unstructured":"Costa, A.: Conjugacy invariants of subshifts: An approach from profinite semigroup theory. Int. J. Algebra Comput. 16(4), 629\u2013655 (2006). https:\/\/doi.org\/10.1142\/s0218196706003232","journal-title":"Int. J. Algebra Comput."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s002240000084","volume":"31","author":"F Durand","year":"1998","unstructured":"Durand, F.: A generalization of Cobham\u2019s theorem. Theoret. Comput. Sci. 31(2), 169\u2013185 (1998). https:\/\/doi.org\/10.1007\/s002240000084","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"6_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discrete Math. 179(1\u20133), 89\u2013101 (1998). https:\/\/doi.org\/10.1016\/S0012-365X(97)00029-0","journal-title":"Discrete Math."},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1017\/S0143385799133947","volume":"19","author":"F Durand","year":"1999","unstructured":"Durand, F., Host, B., Skau, C.: Substitutional dynamical systems, Bratteli diagrams and dimension groups. Ergod. Theory Dyn. Syst. 19(4), 953\u2013993 (1999). https:\/\/doi.org\/10.1017\/S0143385799133947","journal-title":"Ergod. Theory Dyn. Syst."},{"key":"6_CR16","unstructured":"Durand, F., Leroy, J.: The constant of recognizability is computable for primitive morphisms. J. Integer S. 20 (2017)"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Durand, F., Perrin, D.: Dimension Groups and Dynamical Systems. Cambridge Studies in Advanced Mathematics, Cambridge University Press (2022). https:\/\/doi.org\/10.1017\/9781108976039","DOI":"10.1017\/9781108976039"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.jalgebra.2022.05.021","volume":"606","author":"H Goulet-Ouellet","year":"2022","unstructured":"Goulet-Ouellet, H.: Pronilpotent quotients associated with primitive substitutions. J. Algebra 606, 341\u2013370 (2022). https:\/\/doi.org\/10.1016\/j.jalgebra.2022.05.021","journal-title":"J. Algebra"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2022.05.001","volume":"923","author":"H Goulet-Ouellet","year":"2022","unstructured":"Goulet-Ouellet, H.: Suffix-connected languages. Theoret. Comput. Sci. 923, 126\u2013143 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.05.001","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1006\/jabr.2001.9033","volume":"248","author":"I Kapovich","year":"2002","unstructured":"Kapovich, I., Myasnikov, A.: Stallings foldings and subgroups of free groups. J. Algebra 248(2), 608\u2013668 (2002). https:\/\/doi.org\/10.1006\/jabr.2001.9033","journal-title":"J. Algebra"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2012.05.007","volume":"445","author":"K Klouda","year":"2012","unstructured":"Klouda, K.: Bispecial factors in circular non-pushy D0L languages. Theoret. Comput. Sci. 445, 63\u201374 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.007","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR22","unstructured":"Kyriakoglou, R.: Iterated morphisms, combinatorics on words and symbolic dynamical systems. Ph.D. thesis, Universit\u00e9 Paris-Est (2019)"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9781107326019","DOI":"10.1017\/CBO9781107326019"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0020-0190(94)90008-6","volume":"49","author":"A de Luca","year":"1994","unstructured":"de Luca, A., Mione, L.: On bispecial factors of the Thue-Morse word. Inf. Process. Lett. 49(4), 179\u2013183 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)90008-6","journal-title":"Inf. Process. Lett."},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Berlin Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-642-61896-3","DOI":"10.1007\/978-3-642-61896-3"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"221","DOI":"10.5802\/jtnb.91","volume":"5","author":"F Mignosi","year":"1993","unstructured":"Mignosi, F., S\u00e9\u00e9bold, P.: Morphismes sturmiens et r\u00e8gles de Rauzy. J. Th\u00e9or. Nr. Bordx. 5(2), 221\u2013233 (1993). https:\/\/doi.org\/10.5802\/jtnb.91","journal-title":"J. Th\u00e9or. Nr. Bordx."},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B Moss\u00e9","year":"1992","unstructured":"Moss\u00e9, B.: Puissance de mots et reconnaissabilit\u00e9 des points fixes d\u2019une substitution. Theoret. Comput. Sci. 99(2), 327\u2013334 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90357-L","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Queff\u00e9lec, M.: Substitution dynamical systems\u2013spectral analysis, Lecture Notes in Mathematics, vol. 1294. Springer-Verlag, Berlin, second edn. (2010). https:\/\/doi.org\/10.1007\/978-3-642-11212-6","DOI":"10.1007\/978-3-642-11212-6"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/s0304-3975(97)00159-x","volume":"195","author":"P S\u00e9\u00e9bold","year":"1998","unstructured":"S\u00e9\u00e9bold, P.: On the conjugation of standard morphisms. Theoret. Comput. Sci. 195(1), 91\u2013109 (1998). https:\/\/doi.org\/10.1016\/s0304-3975(97)00159-x","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1142\/S0218196706003396","volume":"16","author":"NWM Touikan","year":"2006","unstructured":"Touikan, N.W.M.: A fast algorithm for Stallings\u2019 folding process. Int. J. Algebra Comput. 16(6), 1031\u20131045 (2006). https:\/\/doi.org\/10.1142\/S0218196706003396","journal-title":"Int. J. Algebra Comput."},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/eujc.2000.0444","volume":"22","author":"L Vuillon","year":"2001","unstructured":"Vuillon, L.: A characterization of Sturmian words by return words. Europ. J. Comb. 22(2), 263\u2013275 (2001). https:\/\/doi.org\/10.1006\/eujc.2000.0444","journal-title":"Europ. J. Comb."},{"key":"6_CR32","first-page":"299","volume":"318","author":"ZX Wen","year":"1994","unstructured":"Wen, Z.X., Wen, Z.Y.: Local isomorphisms of the invertible substitutions. C. R. Acad. Sci. Paris 318, 299\u2013304 (1994)","journal-title":"C. R. Acad. Sci. Paris"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:04:08Z","timestamp":1685487848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_6","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)"}}]}}