{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:23Z","timestamp":1740148943160,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12095-022-00592-5","type":"journal-article","created":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T01:02:21Z","timestamp":1658797341000},"page":"309-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Note on a Fibonacci parity sequence"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,26]]},"reference":[{"key":"592_CR1","first-page":"B35b","volume":"35","author":"V Bruy\u00e8re","year":"1995","unstructured":"Bruy\u00e8re, V.: Automata and numeration systems. Sem. Lothar. Combin. 35, B35b (1995). (electronic), https:\/\/www.elibm.org\/article\/10009307","journal-title":"Sem. Lothar. Combin."},{"key":"592_CR2","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1142\/S0129054112400448","volume":"23","author":"\u00c9 Charlier","year":"2012","unstructured":"Charlier, \u00c9., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Internat. J. Found. Comp. Sci. 23, 1035\u20131066 (2012)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"592_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2021.01.011","volume":"859","author":"FM Dekking","year":"2021","unstructured":"Dekking, F.M.: The sum of digits functions of the Zeckendorf and the base phi expansions. Theoret. Comput. Sci. 859, 70\u201379 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"592_CR4","doi-asserted-by":"publisher","first-page":"3679","DOI":"10.1090\/proc\/14015","volume":"146","author":"M Drmota","year":"2018","unstructured":"Drmota, M., M\u00fcllner, C., Spiegelhofer, L.: M\u00f6bius orthogonality for the Zeckendorf sum-of-digits function. Proc. Amer. Math. Soc. 146, 3679\u20133691 (2018)","journal-title":"Proc. Amer. Math. Soc."},{"key":"592_CR5","doi-asserted-by":"publisher","first-page":"R30","DOI":"10.37236\/948","volume":"14","author":"E Ferrand","year":"2007","unstructured":"Ferrand, E.: An analogue of the Thue-Morse sequence. Electron. J. Combin. 14, R30 (2007). (electronic), https:\/\/doi.org\/10.37236\/948","journal-title":"Electron. J. Combin."},{"key":"592_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s12095-021-00507-w","volume":"13","author":"D Jamet","year":"2021","unstructured":"Jamet, D., Popoli, P., Stoll, T.: Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. Cryptogr. Commun. 13, 791\u2013814 (2021)","journal-title":"Cryptogr. Commun."},{"key":"592_CR7","unstructured":"Jansen, C.J.A.: Investigations on Nonlinear Streamcipher Systems: construction and evaluation methods PhD Thesis, Technische Universiteit Delft, Netherlands (1989)"},{"key":"592_CR8","first-page":"190","volume":"29","author":"CG Lekkerkerker","year":"1952","unstructured":"Lekkerkerker, C.G.: Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci. Simon Stevin 29, 190\u2013195 (1952)","journal-title":"Simon Stevin"},{"key":"592_CR9","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut. [cs.FL] arXiv:1603.06017 (2016)"},{"key":"592_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ita\/2016010","volume":"50","author":"H Mousavi","year":"2016","unstructured":"Mousavi, H., Schaeffer, L., Shallit, J.: Decision algorithms for Fibonacci-automatic words, I: Basic results. RAIRO Inform. Th\u00e9or. App. 50, 39\u201366 (2016)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"592_CR11","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.indag.2021.03.004","volume":"32","author":"J Shallit","year":"2021","unstructured":"Shallit, J.: Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking\u2019s conjecture. Indag. Math. 32, 729\u2013735 (2021)","journal-title":"Indag. Math."},{"key":"592_CR12","doi-asserted-by":"crossref","unstructured":"Shallit, J.: Synchronized sequences. In: Lecroq, T., Puzynina, S. (eds.) WORDS 2021, vol. 12847 of Lecture Notes in Computer Science, pp 1\u201319. Springer (2021)","DOI":"10.1007\/978-3-030-85088-3_1"},{"key":"592_CR13","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut. Cambridge University Press. In Press (2022)","DOI":"10.1017\/9781108775267"},{"key":"592_CR14","unstructured":"Sloane, N.J.A., et al.: The on-line encyclopedia of integer sequences. Electronic resource. Available at https:\/\/oeis.org (2022)"},{"key":"592_CR15","first-page":"179","volume":"41","author":"E Zeckendorf","year":"1972","unstructured":"Zeckendorf, E.: Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. Roy. Li\u00e8ge 41, 179\u2013182 (1972)","journal-title":"Bull. Soc. Roy. Li\u00e8ge"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00592-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00592-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00592-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:12:24Z","timestamp":1676304744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00592-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,26]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["592"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00592-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2022,7,26]]},"assertion":[{"value":"22 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}