{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:57Z","timestamp":1776822297656,"version":"3.51.2"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_14","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:53Z","timestamp":1751194133000},"page":"153-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Circularity and\u00a0Repetitiveness in\u00a0Non-Injective DF0L Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3445-8469","authenticated-orcid":false,"given":"Herman","family":"Goulet-Ouellet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-5959","authenticated-orcid":false,"given":"Karel","family":"Klouda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5962-4297","authenticated-orcid":false,"given":"\u0160t\u011bp\u00e1n","family":"Starosta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"14_CR1","unstructured":"Cassaigne, J.: An algorithm to test if a given circular HD0L-language avoids a pattern. In: Pehrson, B., Simon, I. (eds.) Proceedings of the IFIP 13th World Computer Congress. pp. 459\u2013464. Elsevier (1994)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.36045\/bbms\/1105730624","volume":"4","author":"J Cassaigne","year":"1997","unstructured":"Cassaigne, J.: Complexit\u00e9 et facteurs sp\u00e9ciaux. Bull. Bel. Math. Soc. Simon Stevin 4(1), 67\u201388 (1997). https:\/\/doi.org\/10.36045\/bbms\/1105730624","journal-title":"Bull. Bel. Math. Soc. Simon Stevin"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/s0019-9958(78)90095-5","volume":"38","author":"A Ehrenfeucht","year":"1978","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Simplifications of homomorphisms. Inform. Control 38(3), 298\u2013309 (1978). https:\/\/doi.org\/10.1016\/s0019-9958(78)90095-5","journal-title":"Inform. Control"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Frid, A., Avgustinovich, S.V.: On bispecial words and subword complexity of DOL sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London (1999). https:\/\/doi.org\/10.1007\/978-1-4471-0551-0_13","DOI":"10.1007\/978-1-4471-0551-0_13"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jda.2015.03.006","volume":"33","author":"K Klouda","year":"2015","unstructured":"Klouda, K., Starosta, \u0160: An algorithm for enumerating all infinite repetitions in a D0L-system. J. Discrete Algorithms 33, 130\u2013138 (2015). https:\/\/doi.org\/10.1016\/j.jda.2015.03.006","journal-title":"J. Discrete Algorithms"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.105904","volume":"206","author":"K Klouda","year":"2024","unstructured":"Klouda, K., Starosta, \u0160: The number of primitive words of unbounded exponent in the language of an HD0L-system is finite. J. Comb. Theory, Ser. A 206, 105904 (2024). https:\/\/doi.org\/10.1016\/j.jcta.2024.105904","journal-title":"J. Comb. Theory, Ser. A"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2019.04.021","volume":"790","author":"K Klouda","year":"2019","unstructured":"Klouda, K., Starosta, \u0160: Characterization of circular D0L-systems. Theoret. Comput. Sci. 790, 131\u2013137 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.04.021","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR8","unstructured":"Kyriakoglou, R.: Iterated morphisms, combinatorics on words and symbolic dynamical systems. Ph.D. thesis, Universit\u00e9 Paris-Est (2019)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume-title":"Automata, Languages and Programming","author":"F Mignosi","year":"1993","unstructured":"Mignosi, F., S\u00e9\u00e9bold, P.: If a DOL language is k-power free then it is circular. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 507\u2013518. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56939-1_98"},{"issue":"2","key":"14_CR10","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. Theor. Comput. Sci. 99(2), 327\u2013334 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90357-L","journal-title":"Theor. Comput. Sci."},{"key":"14_CR11","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press (1980)"},{"key":"14_CR12","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."}],"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-97548-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:21:53Z","timestamp":1776820913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","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":"Nancy","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}