{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:54Z","timestamp":1759639074307},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0304-3975(96)00141-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"281-291","source":"Crossref","is-referenced-by-count":61,"title":["A characterization of the squares in a Fibonacci string"],"prefix":"10.1016","volume":"172","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Moore","sequence":"additional","affiliation":[]},{"given":"W.F.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00141-7_BIB1","article-title":"Algorithms for finding patterns in strings","author":"Aho","year":"1988"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB3","first-page":"13","article-title":"Fibonacci words","author":"Berstel","year":"1986"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB5","unstructured":"L.J. Cummings, D. Moore and J. Karhumaki, Borders of Fibonacci strings, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB6","unstructured":"L.J. Cummings and W.F. Smyth, Weak repetitions in strings, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(81)90099-5","article-title":"A combinatorial property of the Fibonacci words","volume":"12","author":"de Luca","year":"1981","journal-title":"Information Process. Lett."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB8","series-title":"History of the Theory of Numbers","author":"Dickson","year":"1971"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB9","series-title":"Proc. 4th Ann. Symp. on Combinatorial Pattern Matching","first-page":"54","article-title":"Covering a string","author":"Iliopoulos","year":"1993"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB10","unstructured":"C.S. Iliopoulos and W.F. Smyth, The covers of a circular Fibonacci String, submitted."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB11","series-title":"The Art of Computer Programming","author":"Knuth","year":"1971"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","article-title":"An optimal algorithm to compute all the covers of a string","volume":"50","author":"Moore","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00141-7_BIB15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ita\/1983170201311","article-title":"Mots infinis de Fibonacci et morphismes it\u00e9r\u00e9s","volume":"17","author":"Pansiot","year":"1983","journal-title":"RAIRO Inform. Th\u00e9orique"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB16","article-title":"Propri\u00e9t\u00e9s Combinatoires des Mots Infinis Engendr\u00e9s par Certains Morphismes","author":"S\u00e9\u00e9bold","year":"1985"},{"key":"10.1016\/S0304-3975(96)00141-7_BIB17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular sequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Molecular Biol."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:02Z","timestamp":1556522702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0304397596001417"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00141-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}