{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:39Z","timestamp":1759637619075},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00238-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:46:25Z","timestamp":1027651585000},"page":"337-378","source":"Crossref","is-referenced-by-count":7,"title":["Repetitiveness of languages generated by morphisms"],"prefix":"10.1016","volume":"240","author":[{"given":"Yuji","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00238-8_BIB1","series-title":"Transductions and Context-free Languages, Teubner Studienb\u00fccher","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(86)90034-7","article-title":"Every iterated morphism yields a co-CFL","volume":"22","author":"Berstel","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB3","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/S0019-9958(78)90095-5","article-title":"Simplifications of homomorphisms","volume":"38","author":"Ehrenfeucht","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","article-title":"On the subword complexity of square-free D0L languages","volume":"16","author":"Ehrenfeucht","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0019-9958(83)80028-X","article-title":"Repetition of subwords in D0L languages","volume":"59","author":"Ehrenfeucht","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0304-3975(84)90093-8","article-title":"The equations h(w)=wn in binary alphabets","volume":"33","author":"Harju","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(86)90023-X","article-title":"Periodic D0L languages","volume":"46","author":"Head","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","article-title":"Mathematical models for cellular interactions in development","volume":"18","author":"Lindenmayer","year":"1968","journal-title":"Parts I and II, J. Theoret. Biol."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB10","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB11","first-page":"507","article-title":"If a D0L language is k-power free then it is circular","volume":"Vol. 700","author":"Mignosi","year":"1993"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(92)90264-G","article-title":"Proofs of Dejean's conjecture for alphabets with 5,6,7,8,9,10 and 11 letters","volume":"95","author":"Ollagnier","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB13","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB14","doi-asserted-by":"crossref","unstructured":"G. Rozenberg, A. Salomaa (Eds.), Lindenmayer Systems, Springer, Berlin, 1992.","DOI":"10.1007\/978-3-642-58117-5"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB15","first-page":"137","article-title":"An effective solution to the D0L periodicity problem in the binary case","volume":"36","author":"S\u00e9\u00e9bold","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(99)00238-8_BIB16","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I. Math.-Nat. Kl."},{"key":"10.1016\/S0304-3975(99)00238-8_BIB17","first-page":"1","article-title":"\u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr. I. Math.-Nat. Kl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T07:53:51Z","timestamp":1555228431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002388"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00238-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}