{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T03:06:57Z","timestamp":1767150417466,"version":"build-2238731810"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0304-3975(98)00252-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"95-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["The exact number of squares in Fibonacci words"],"prefix":"10.1016","volume":"218","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Simpson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00252-7_BIB1","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(98)00252-7_BIB2","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(98)00252-7_BIB3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01190846","article-title":"Squares, cubes, and time-space efficient string searching","volume":"13","author":"Crochemore","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00252-7_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1051\/ita\/1990240302051","article-title":"A combinatorial theorem on p-power-free words and an application to semigroups","volume":"24","author":"de Luca","year":"1990","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"10.1016\/S0304-3975(98)00252-7_BIB5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.4153\/CMB-1978-077-0","article-title":"Determination of [n\u03b8] by its sequence of differences","volume":"21","author":"Fraenkel","year":"1978","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0304-3975(98)00252-7_BIB6","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.1997.2843","article-title":"How many squares can a string contain?","volume":"82","author":"Fraenkel","year":"1998","journal-title":"J. Combinat. Theory (Ser. A)"},{"key":"10.1016\/S0304-3975(98)00252-7_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","article-title":"A characterization of the squares in a Fibonacci string","volume":"172","author":"Iliopoulos","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00252-7_BIB8","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"key":"10.1016\/S0304-3975(98)00252-7_BIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","article-title":"Repetitions in the Fibonacci infinite word","volume":"26","author":"Mignosi","year":"1992","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"10.1016\/S0304-3975(98)00252-7_BIB10","author":"S\u00e9\u00e9bold","year":"1985"},{"key":"10.1016\/S0304-3975(98)00252-7_BIB11","doi-asserted-by":"crossref","first-page":"473","DOI":"10.4153\/CMB-1976-071-6","article-title":"Beatty sequences, continued fractions, and certain shift operators","volume":"19","author":"Stolarsky","year":"1976","journal-title":"Canad. Math. Bull."}],"updated-by":[{"DOI":"10.1016\/j.tcs.2014.06.011","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T00:00:00Z","timestamp":1409184000000}}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:31Z","timestamp":1759625491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002527"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00252-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The exact number of squares in Fibonacci words","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00252-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}