{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:21Z","timestamp":1779448281151,"version":"3.53.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371086"],"award-info":[{"award-number":["12371086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271175"],"award-info":[{"award-number":["12271175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115880","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:12:51Z","timestamp":1772842371000},"page":"115880","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["N-factor complexity of the Fibonacci sequence on N and the factor-counting sequences"],"prefix":"10.1016","volume":"1072","author":[{"given":"Yanxi","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8375-2018","authenticated-orcid":false,"given":"Wen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115880_bib0001","author":"Berth\u00e9","year":"2010"},{"key":"10.1016\/j.tcs.2026.115880_bib0002","doi-asserted-by":"crossref","first-page":"815","DOI":"10.2307\/2371264","article-title":"Symbolic dynamics","volume":"60","author":"Morse","year":"1938","journal-title":"Amer. J. Math."},{"key":"10.1016\/j.tcs.2026.115880_bib0003","first-page":"1","volume":"62","author":"Morse","year":"1940","journal-title":"Symbolic dynamics II"},{"issue":"1","key":"10.1016\/j.tcs.2026.115880_bib0004","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","article-title":"Subword complexities of various classes of deterministic developmental languages without interactions","volume":"1","author":"Ehrenfeucht","year":"1975","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115880_bib0005","series-title":"Automatic Sequences Theory, Applications, Generalizations","author":"Allouche","year":"2003"},{"key":"10.1016\/j.tcs.2026.115880_bib0006","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\/j.tcs.2026.115880_bib0007","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.crma.2008.06.013","article-title":"On the triplex substitution combinatorial properties","volume":"346","author":"Tan","year":"2008","journal-title":"Comptes Rendus Math."},{"key":"10.1016\/j.tcs.2026.115880_bib0008","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-66396-8_14","article-title":"A Set of Sequences of Complexity 2n+1","volume":"10432","author":"Cassaigne","year":"2017"},{"key":"10.1016\/j.tcs.2026.115880_bib0009","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2140\/moscow.2022.11.287","article-title":"Almost everywhere balanced sequences of complexity 2n+1","volume":"11","author":"Cassaigne","year":"2022","journal-title":"Mosc. J. Comb. Number Theory"},{"key":"10.1016\/j.tcs.2026.115880_bib0010","first-page":"153","article-title":"Double sequences with complexity mn+1","volume":"4","author":"Cassaigne","year":"1999","journal-title":"J. Autom. Lang. Comb."},{"key":"10.1016\/j.tcs.2026.115880_bib0011","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1007\/s11202-009-0076-6","article-title":"On the permutations generated by the Sturmian words","volume":"50","author":"Makarov","year":"2009","journal-title":"Sib. Math. J."},{"key":"10.1016\/j.tcs.2026.115880_bib0012","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.aam.2010.08.002","article-title":"Permutation complexity of the Thue-Morse word","volume":"47","author":"Widmer","year":"2011","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115880_bib0013","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.aam.2010.01.006","article-title":"Balance and abelian complexity of the Tribonacci word","volume":"45","author":"Richomme","year":"2010","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115880_bib0014","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1112\/jlms\/jdq063","article-title":"Abelian complexity of minimal subshifts","volume":"83","author":"Richomme","year":"2011","journal-title":"J. London Math. Soc."},{"key":"10.1016\/j.tcs.2026.115880_bib0015","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2006.02.023","article-title":"Maximal pattern complexity of two-dimensional words","volume":"359","author":"Kamae","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115880_bib0016","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","article-title":"Palindrome complexity","volume":"292","author":"Allouche","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115880_bib0017","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.tcs.2007.03.019","article-title":"Factor versus palindromic complexity of uniformly recurrent infinite words","volume":"380","author":"Bal\u00e1\u017ei","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115880_bib0018","first-page":"2","article-title":"Some properties of the Fibonacci sequence on an infinite alphabet","volume":"24","author":"Zhang","year":"2017","journal-title":"Electron. J. Comb."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:56Z","timestamp":1779447776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":18,"alternative-id":["S0304397526001398"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115880","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"N-factor complexity of the Fibonacci sequence on and the factor-counting sequences","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115880","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115880"}}