{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T01:15:07Z","timestamp":1770426907064,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00320-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"539-553","source":"Crossref","is-referenced-by-count":193,"title":["Episturmian words and some constructions of de Luca and Rauzy"],"prefix":"10.1016","volume":"255","author":[{"given":"Xavier","family":"Droubay","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Justin","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Pirillo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00320-5_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.24033\/bsmf.2164","article-title":"Repr\u00e9sentation g\u00e9ometrique des suites de complexit\u00e9 2n+1","volume":"119","author":"Arnoux","year":"1991","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/S0304-3975(99)00320-5_BIB2","unstructured":"J. Berstel, P. Seebold, Sturmian words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Preliminary Version (February 16, 1999), Institut Gaspard Monge, Univ. Marne-la-Vall\u00e9e (Chapter 2)."},{"key":"10.1016\/S0304-3975(99)00320-5_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.5802\/jtnb.83","article-title":"Substitution invariant cutting sequences","volume":"5","author":"Crisp","year":"1993","journal-title":"J. Th\u00e9orie Nombres Bordeaux"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(99)00320-5_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0304-3975(96)00054-0","article-title":"On standard Sturmian morphisms","volume":"178","author":"de Luca","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00320-5_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","article-title":"Sturmian words","volume":"183","author":"de Luca","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00320-5_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0304-3975(97)00188-6","article-title":"Palindromes and Sturmian words","volume":"223","author":"Droubay","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00320-5_BIB7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1051\/ita\/1997310302711","article-title":"Decimations and Sturmian words","volume":"31","author":"Justin","year":"1997","journal-title":"Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0304-3975(99)00320-5_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.5802\/jtnb.91","article-title":"Morphismes Sturmiens et r\u00e8gles de Rauzy","volume":"5","author":"Mignosi","year":"1993","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"10.1016\/S0304-3975(99)00320-5_BIB9","first-page":"2501","article-title":"Suites \u00e0 termes dans un alphabet fini","volume":"25","author":"Rauzy","year":"19821983","journal-title":"S\u00e9m. Th\u00e9or. Nombres Bordeaux"},{"key":"10.1016\/S0304-3975(99)00320-5_BIB10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.24033\/bsmf.1957","article-title":"Nombres alg\u00e9briques et substitutions","volume":"110","author":"Rauzy","year":"1982","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/S0304-3975(99)00320-5_BIB11","doi-asserted-by":"crossref","unstructured":"G. Rauzy, Mots infinis en arithm\u00e9tique, in: M. Nivat, D. Perrin (Eds.), Automata on Infinite Words, Lecture Notes in Computer Science, Vol. 192, 1985, pp. 167\u2013171.","DOI":"10.1007\/3-540-15641-0_32"},{"key":"10.1016\/S0304-3975(99)00320-5_BIB12","unstructured":"S. Tabachnikov, Billiards, Panoramas et Synth\u00e8ses 1, Soc. Math. France, 1995."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:59:50Z","timestamp":1555707590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599003205"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00320-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}