{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T03:24:28Z","timestamp":1770693868933,"version":"3.49.0"},"reference-count":20,"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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"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":[[1999,4]]},"DOI":"10.1016\/s0304-3975(98)00258-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"177-195","source":"Crossref","is-referenced-by-count":13,"title":["Complexity for finite factors of infinite sequences"],"prefix":"10.1016","volume":"218","author":[{"given":"S\u00e9bastien","family":"Ferenczi","sequence":"first","affiliation":[]},{"given":"Zolt\u00e1n","family":"K\u00e1sa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00258-8_BIB1","first-page":"133","article-title":"Sur la complexit\u00e9 des suites infinies","volume":"1\u20132","author":"Allouche","year":"1994","journal-title":"Bull. Belg. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.24033\/bsmf.2164","article-title":"Repr\u00e9sentation g\u00e9om\u00e9trique de suites de complexit\u00e9 2n + 1","volume":"119","author":"Arnoux","year":"1991","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB3","series-title":"Developments in language theory","article-title":"Recent results in Sturmian words","author":"Berstel","year":"1995"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(95)00224-3","article-title":"Fr\u00e9quences des facteurs des suites sturmiennes","volume":"165","author":"Berth\u00e9","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB5","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB6","unstructured":"J. Cassaigne, Sequences with grouped factors, preprint."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB7","doi-asserted-by":"crossref","unstructured":"N. Chekhova, Covering numbers of rotations, Theoret. Comput. Sci., accepted for publication.","DOI":"10.1016\/S0304-3975(97)00256-9"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB8","article-title":"Nombres de recouvrement","author":"Chekhova","year":"1997"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB9","unstructured":"N. Chekhova, P. Hubert, A. Messaoudi, Propri\u00e9t\u00e9s combinatoires, ergodiques et arithm\u00e9tiques de la suite de Tribonacci, preprint."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB10","series-title":"Dipartimento di Matematica Universita' di Roma \u2018La Sapienza\u2019 Proc. of the workshop, Complexity of the living: a modelistic approach","article-title":"Special factors in biological strings","author":"Colosimo","year":"1997"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0304-3975(98)00248-5","article-title":"On the combinatorics of finite words","volume":"218","author":"de Luca","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB12","doi-asserted-by":"crossref","unstructured":"G. Didier, Codages de rotations et fractions continues, J. Number Theoret, to appear.","DOI":"10.1006\/jnth.1998.2246"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB13","doi-asserted-by":"crossref","unstructured":"S. Ferenczi, Complexity of sequences and dynamical systems, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(98)00400-2"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB14","doi-asserted-by":"crossref","first-page":"815","DOI":"10.2307\/2371264","article-title":"Symbolic dynamics","volume":"60","author":"Hedlund","year":"1938","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2371431","article-title":"Symbolic dynamics II: Sturmian trajectories","volume":"62","author":"Hedlund","year":"1940","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB16","first-page":"69","article-title":"On the d-complexity of words","volume":"8","author":"Iv\u00e1nyi","year":"1987","journal-title":"Ann. Univ. Sci. Budapest Sect. Comput."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB17","series-title":"presented at the 1st Joint Conf. on Modern Applied Mathematics","article-title":"On the d-complexity of strings","author":"K\u00e1sa","year":"1995"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB18","unstructured":"I. Nakashima, J.-I. Tamura, S.-I. Yasutomi, Modified complexity and \u2605-Sturmian words, preprint."},{"key":"10.1016\/S0304-3975(98)00258-8_BIB19","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1006\/jnth.1994.1012","article-title":"Sequences with subword complexity 2n","volume":"46","author":"Rote","year":"1994","journal-title":"J. Number Theory"},{"key":"10.1016\/S0304-3975(98)00258-8_BIB20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02988306","article-title":"On the maximum number of distinct factors in a binary string","volume":"9","author":"Shallit","year":"1993","journal-title":"Graphs Comb."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:20:43Z","timestamp":1555406443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002588"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00258-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}