{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:44:54Z","timestamp":1720201494927},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"vor","delay-in-days":1465,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.tcs.2018.12.016","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T23:40:15Z","timestamp":1546645215000},"page":"68-75","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["The number of valid factorizations of Fibonacci prefixes"],"prefix":"10.1016","volume":"775","author":[{"given":"Pierre","family":"Bonardo","sequence":"first","affiliation":[]},{"given":"Anna E.","family":"Frid","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.12.016_br0020","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1051\/ita:2001127","article-title":"An exercise on Fibonacci representations","volume":"35","author":"Berstel","year":"2001","journal-title":"Theor. Inform. Appl."},{"key":"10.1016\/j.tcs.2018.12.016_br0030","series-title":"Algebraic Combinatorics on Words","first-page":"45","article-title":"Sturmian words","author":"Berstel","year":"2002"},{"key":"10.1016\/j.tcs.2018.12.016_br0040","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.ejc.2018.04.003","article-title":"Sturmian numeration systems and decompositions to palindromes","volume":"71","author":"Frid","year":"2018","journal-title":"European J. Combin."},{"key":"10.1016\/j.tcs.2018.12.016_br0050","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","article-title":"On cube-free \u03c9-words generated by binary morphisms","volume":"5","author":"Karhum\u00e4ki","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2018.12.016_br0060","first-page":"190","article-title":"Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci","volume":"29","author":"Lekkerkerker","year":"1952","journal-title":"Simon Stevin"},{"key":"10.1016\/j.tcs.2018.12.016_br0070","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1051\/ita\/2016010","article-title":"Decision algorithms for Fibonacci-automatic words, I: basic results","volume":"51","author":"Mousavi","year":"2016","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/j.tcs.2018.12.016_br0080","author":"Sloane"},{"issue":"2","key":"10.1016\/j.tcs.2018.12.016_br0100","first-page":"103","article-title":"A smooth tight upper bound for the Fibonacci representation function R(N)","volume":"46\/47","author":"Stockmeyer","year":"2009","journal-title":"Fibonacci Quart."},{"key":"10.1016\/j.tcs.2018.12.016_br0110","first-page":"179","article-title":"Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas","volume":"41","author":"Zeckendorf","year":"1972","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518307497?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518307497?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T10:30:22Z","timestamp":1712399422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518307497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":9,"alternative-id":["S0304397518307497"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.12.016","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The number of valid factorizations of Fibonacci prefixes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.12.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}