{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T22:29:15Z","timestamp":1783204155027,"version":"3.54.6"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0097-3165(81)90038-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"19-42","source":"Crossref","is-referenced-by-count":128,"title":["Periods in strings"],"prefix":"10.1016","volume":"30","author":[{"given":"Leo J","family":"Guibas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew M","family":"Odlyzko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(81)90038-8_BIB1","first-page":"762","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0097-3165(81)90038-8_BIB2","first-page":"109","article-title":"Uniqueness theorems for periodic functions","volume":"16","author":"Fine","year":"1965"},{"key":"10.1016\/0097-3165(81)90038-8_BIB3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1038\/scientificamerican0574-120","article-title":"On the paradoxical situations that arise from nontransitive relations","author":"Gardner","year":"1974","journal-title":"Sci. Amer."},{"key":"10.1016\/0097-3165(81)90038-8_BIB4","series-title":"Proceedings, 18th Annual Symposium on Foundations of Computer Science Proceedings","article-title":"A new proof of the linearity of the Boyer-Moore string searching algorithm","author":"Guibas","year":"1977"},{"key":"10.1016\/0097-3165(81)90038-8_BIB5","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, J. Combinatorial Theory Ser. A, in press.","DOI":"10.1016\/0097-3165(81)90005-4"},{"key":"10.1016\/0097-3165(81)90038-8_BIB6","series-title":"Proceedings, 18th Annual Symposium on Foundations of Computer Science Proceedings","article-title":"Saving space in fast string matching","author":"Galil","year":"1977"},{"key":"10.1016\/0097-3165(81)90038-8_BIB7","first-page":"139","article-title":"Endliche 0-1-Folgen mit gleichen Teilbl\u00f6cken","volume":"271","author":"Harborth","year":"1974","journal-title":"Crelle's J."},{"key":"10.1016\/0097-3165(81)90038-8_BIB8","doi-asserted-by":"crossref","first-page":"323","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\/0097-3165(81)90038-8_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = bNcP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0097-3165(81)90038-8_BIB10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TIT.1973.1055064","article-title":"On the expected duration of a search for a fixed pattern in random data","author":"Nielsen","year":"1973","journal-title":"IEEE Trans. Inform Theory"},{"key":"10.1016\/0097-3165(81)90038-8_BIB11","series-title":"Actes de Colloque sur le semigroups \u00e0 Szeged","article-title":"A property of finitely generated submonoids of free monoids","author":"Sch\u00fctzenberger","year":"1976"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T23:43:50Z","timestamp":1625442230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316581900388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0097316581900388"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(81)90038-8","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}