{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:40:26Z","timestamp":1648993226019},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"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":[[2003,5]]},"DOI":"10.1016\/s0304-3975(02)00589-3","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"321-340","source":"Crossref","is-referenced-by-count":4,"title":["Euclidean strings"],"prefix":"10.1016","volume":"301","author":[{"given":"John","family":"Ellis","sequence":"first","affiliation":[]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[]},{"given":"Jamie","family":"Simpson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00589-3_BIB1","series-title":"Automatic Sequences","author":"Allouche","year":"2002"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2300153","article-title":"Problem 3173","volume":"33","author":"Beatty","year":"1926","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0304-3975(96)00101-6","article-title":"Sturmian words, Lyndon words and trees","volume":"178","author":"Berstel","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB4","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/2589182","article-title":"Recounting the rationals","volume":"107","author":"Calkin","year":"2000","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB5","series-title":"Introduction to Algorithms","author":"Corman","year":"1990"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(95)00080-V","article-title":"Palindromes in the Fibonacci word","volume":"55","author":"Droubay","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB7","unstructured":"J. Ellis, S. Chow, D. Manke, Embedding grids into cylinders, tori and hypercubes, SIAM J. Comput., to appear."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB8","series-title":"Proc. Eleventh Australian Workshop on Combinatorial Algorithms","first-page":"87","article-title":"Euclidean strings","author":"Ellis","year":"2000"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB9","doi-asserted-by":"crossref","first-page":"6","DOI":"10.4153\/CJM-1969-002-7","article-title":"The bracket function and complementary sets of integers","volume":"21","author":"Fraenkel","year":"1967","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0304-3975(98)00252-7","article-title":"The exact number of squares in Fibonacci words","volume":"218","author":"Fraenkel","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB11","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB12","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1960"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00589-3_BIB13","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(02)00589-3_BIB14","first-page":"227","article-title":"The covers of a circular Fibonacci string","volume":"26","author":"Iliopoulos","year":"1998","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB15","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"key":"10.1016\/S0304-3975(02)00589-3_BIB16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","article-title":"Some combinatorial properties of Sturmian words","volume":"136","author":"de Luca","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB17","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/S0895480100368050","article-title":"The number of Lyndon words and irreducible polynomials of given trace","volume":"14","author":"Ruskey","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(02)00589-3_BIB18","unstructured":"W. Zhi-Xiong, W. Zhi-Ying, Some properties of the singular words of the Fibonacci word, S\u00e9minaire Lotharingien de Combinatoire, 30, 1993."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:50:06Z","timestamp":1553907006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502005893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397502005893"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00589-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}