{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T17:48:44Z","timestamp":1776707324279,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10998-021-00390-1","type":"journal-article","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T05:23:51Z","timestamp":1625117031000},"page":"37-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sumsets of Wythoff sequences, Fibonacci representation, and beyond"],"prefix":"10.1007","volume":"84","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":[[2021,7,1]]},"reference":[{"key":"390_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0001-8708(02)00043-9","volume":"175","author":"A Barb\u00e9","year":"2003","unstructured":"A. Barb\u00e9, F. von Haeseler, Limit sets of automatic sequences. Adv. Math. 175, 169\u2013196 (2003)","journal-title":"Adv. Math."},{"key":"390_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-319-98654-8_10","volume-title":"DLT 2018","author":"J Bell","year":"2018","unstructured":"J. Bell, T.F. Lidbetter, J. Shallit, Additive number theory via approximation by regular languages, in DLT 2018, vol. 11088, Lecture Notes in Computer Science, ed. by M. Hoshi, S. Seki (Springer, Berlin, 2018), pp. 121\u2013132"},{"key":"390_CR3","first-page":"43","volume":"10","author":"L Carlitz","year":"1972","unstructured":"L. Carlitz, R. Scoville, V.E. Hoggatt Jr., Fibonacci representations of higher order. Fibonacci Q. 10, 43\u201369 (1972)","journal-title":"Fibonacci Q."},{"issue":"1","key":"390_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/8905","volume":"27","author":"FM Dekking","year":"2020","unstructured":"F.M. Dekking, J. Shallit, N.J.A. Sloane, Queens in exile: non-attacking queens on infinite chess boards. Electron. J. Combin. 27(1), 1\u201327 (2020)","journal-title":"Electron. J. Combin."},{"key":"390_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2016.10.005","volume":"657","author":"CF Du","year":"2017","unstructured":"C.F. Du, H. Mousavi, E. Rowland, L. Schaeffer, J. Shallit, Decision algorithms for Fibonacci-automatic words, II: related sequences and avoidability. Theor. Comput. Sci. 657, 146\u2013162 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"390_CR6","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1142\/S0129054116500386","volume":"29","author":"CF Du","year":"2016","unstructured":"C.F. Du, H. Mousavi, L. Schaeffer, J. Shallit, Decision algorithms for Fibonacci-automatic words, III: enumeration and abelian properties. Int. J. Found. Comput. Sci. 29(8), 943\u2013963 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"390_CR7","first-page":"71","volume":"1","author":"M Feinberg","year":"1963","unstructured":"M. Feinberg, Fibonacci\u2013Tribonacci. Fibonacci Q. 1(3), 71\u201374 (1963)","journal-title":"Fibonacci Q."},{"key":"390_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Boston, 1979)"},{"key":"390_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-020-00343-0","author":"S Kawsumarng","year":"2020","unstructured":"S. Kawsumarng, T. Khemaratchatakumthorn, P. Noppakaew, P. Pongsriiam, Sumsets associated with Wythoff sequences and Fibonacci numbers. Period. Math. Hung. (2020). https:\/\/doi.org\/10.1007\/s10998-020-00343-0","journal-title":"Period. Math. Hung."},{"key":"390_CR10","first-page":"190","volume":"29","author":"CG Lekkerkerker","year":"1952","unstructured":"C.G. Lekkerkerker, Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci. Simon Stevin 29, 190\u2013195 (1952)","journal-title":"Simon Stevin"},{"key":"390_CR11","unstructured":"H. Mousavi, Automatic theorem proving in Walnut. Available at arXiv:1603.06017 (2016)"},{"key":"390_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ita\/2016010","volume":"50","author":"H Mousavi","year":"2016","unstructured":"H. Mousavi, L. Schaeffer, J. Shallit, Decision algorithms for Fibonacci-automatic words, I: basic results. RAIRO Inform. Th\u00e9or. Appl. 50, 39\u201366 (2016)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"390_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-25141-7","volume-title":"WORDS 2015","author":"H Mousavi","year":"2015","unstructured":"H. Mousavi, J. Shallit, Mechanical proofs of properties of the Tribonacci word, in WORDS 2015, vol. 9304, Lecture Notes in Computer Science, ed. by F. Manea, D. Nowotka (Springer, Berlin, 2015), pp. 1\u201321"},{"key":"390_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/9781439864500","volume-title":"A = B","author":"M Petkov\u0161ek","year":"1996","unstructured":"M. Petkov\u0161ek, H.S. Wilf, D. Zeilberger, A = B (A. K. Peters, Natick, 1996)"},{"key":"390_CR15","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s00224-019-09929-9","volume":"64","author":"A Rajasekaran","year":"2020","unstructured":"A. Rajasekaran, J. Shallit, T. Smith, Additive number theory via automata theory. Theor. Comput. Syst. 64, 542\u2013567 (2020)","journal-title":"Theor. Comput. Syst."},{"key":"390_CR16","first-page":"380","volume":"14","author":"R Silber","year":"1972","unstructured":"R. Silber, A Fibonacci property of Wythoff pairs. Fibonacci Q. 14, 380\u2013384 (1972)","journal-title":"Fibonacci Q."},{"key":"390_CR17","unstructured":"N.J.A. Sloane, et al., The On-Line Encyclopedia of Integer Sequences. Available at https:\/\/oeis.org (2020)"},{"key":"390_CR18","first-page":"179","volume":"41","author":"E Zeckendorf","year":"1972","unstructured":"E. Zeckendorf, Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. R. Li\u00e8ge 41, 179\u2013182 (1972)","journal-title":"Bull. Soc. R. Li\u00e8ge"}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-021-00390-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10998-021-00390-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-021-00390-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T09:06:14Z","timestamp":1644915974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10998-021-00390-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["390"],"URL":"https:\/\/doi.org\/10.1007\/s10998-021-00390-1","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,1]]},"assertion":[{"value":"23 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}