{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:59:13Z","timestamp":1780743553434,"version":"3.54.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031617157","type":"print"},{"value":"9783031617164","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-61716-4_6","type":"book-chapter","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:47:52Z","timestamp":1716954472000},"page":"100-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Morphisms for\u00a0Arithmetic Subsequences of\u00a0Fibonacci"],"prefix":"10.1007","author":[{"given":"Wieb","family":"Bosma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henk","family":"Don","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences, Theory Applications Generalizations","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences, Theory Applications Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cassaigne, J.: Recurrence in infinite words. In: Ferreira, A., Reichel, H. (eds.) Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), Lecture Notes in Computer Science 2010, pp.\u00a01\u201311 (2001)","DOI":"10.1007\/3-540-44693-1_1"},{"key":"6_CR3","unstructured":"Charlier, \u00c9., Rampersad, N., Rigo, M., Waxweiler, L.: The minimal automaton recognizing $$m\\mathbb{N}$$ in a linear numeration system. Integers 11B (2011)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(94)90254-2","volume":"126","author":"FM Dekking","year":"1994","unstructured":"Dekking, F.M.: Iteration of maps by an automaton. Discret. Math. 126, 181\u2013186 (1994)","journal-title":"Discret. Math."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"102536","DOI":"10.1016\/j.aam.2023.102536","volume":"148","author":"M Dekking","year":"2023","unstructured":"Dekking, M., Keane, M.: Two-block substitutions and morphic words. Adv. Appl. Math. 148, 102536 (2023)","journal-title":"Adv. Appl. Math."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Freyd, P., Brown, K.S.: Problems and solutions: solutions: E3410. Am. Math. Mon. 99(3), 278\u2013279 (2013). https:\/\/doi.org\/10.2307\/2325076. JSTOR 2325076","DOI":"10.2307\/2325076"},{"key":"6_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033067","volume-title":"Fibonacci and Lucas Numbers with Applications","author":"T Koshy","year":"2001","unstructured":"Koshy, T.: Fibonacci and Lucas Numbers with Applications. Wiley, New York (2001)"},{"key":"6_CR8","unstructured":"Lind, D., Morris, R.A., Shapiro, L.D.: Tables of Fibonacci Entry Points, Part II, Fibonacci Association (1965)"},{"issue":"4","key":"6_CR9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1080\/00150517.2012.12427984","volume":"50","author":"D Marques","year":"2012","unstructured":"Marques, D.: Fixed points of the order of appearance in the Fibonacci sequence. Fibonacci Quart. 50(4), 346\u2013352 (2012)","journal-title":"Fibonacci Quart."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Marques, D.: Sharper upper bounds for the order of appearance in the Fibonacci sequence. Fibonacci Quart. 51 (2013)","DOI":"10.1080\/00150517.2013.12427942"},{"key":"6_CR11","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut (2016). arXiv:1603.06017"},{"key":"6_CR12","unstructured":"OEIS Foundation Inc. Entry A143667 in the On-Line Encyclopedia of Integer Sequences (2024). https:\/\/oeis.org\/A143667"},{"issue":"2","key":"6_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1080\/00150517.1975.12430669","volume":"13","author":"HJA Sall\u00e9","year":"1975","unstructured":"Sall\u00e9, H.J.A.: Maximum value for the rank of apparition of integers in recursive sequences. Fibonacci Quart. 13(2), 159\u2013161 (1975)","journal-title":"Fibonacci Quart."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach To Automatic Sequences: Exploring Combinatorics on Words with Walnut, Vol. 482 of London Math. Society Lecture Note Series. Cambridge University Press, Cambridge (2023)","DOI":"10.1017\/9781108775267"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/00029890.1960.11989541","volume":"67","author":"DD Wall","year":"1960","unstructured":"Wall, D.D.: Fibonacci series modulo $$m$$. Am. Math. Mon. 67, 525\u2013532 (1960)","journal-title":"Am. Math. Mon."},{"key":"6_CR16","unstructured":"Wunderlich, M.: Tables of Fibonacci Entry Points, Part I, Fibonacci Association (1965)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Zantema, H.: Characterizing morphic sequences (2023). arXiv:2309.10562","DOI":"10.1201\/9781003466000-13"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"104710","DOI":"10.1016\/j.ic.2021.104710","volume":"288","author":"H Zantema","year":"2022","unstructured":"Zantema, H., Bosma, W.: Complexity of automatic sequences. Inf. Comput. 288, 104710 (2022)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Logics and Type Systems in Theory and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-61716-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T15:18:48Z","timestamp":1732115928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61716-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031617157","9783031617164"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61716-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}