{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:36:41Z","timestamp":1742992601406,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031427527"},{"type":"electronic","value":"9783031427534"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42753-4_18","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"270-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proving Results About OEIS Sequences with\u00a0Walnut"],"prefix":"10.1007","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":[[2023,8,28]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4471-0551-0_1","volume-title":"Sequences and Their Applications","author":"JP Allouche","year":"1999","unstructured":"Allouche, J.P., Shallit, J.O.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications, pp. 1\u201316. Springer, London (1999). https:\/\/doi.org\/10.1007\/978-1-4471-0551-0_1"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Avgustinovich, S.V.: The number of different subwords of given length in the Morse-Hedlund sequence. Sibirsk. Zh. Issled. Oper. 1, 3\u20137, 103 (1994, in Russian). English translation in A. D. Korshunov (ed.) Discrete Analysis and Operations Research, pp. 1\u20135. Kluwer (1996)","DOI":"10.1007\/978-94-009-1606-7_1"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bell, J.P., Shallit, J.: Counterexamples to a conjecture of Dombi in additive number theory. Acta Math. Hung. (2023, to appear)","DOI":"10.1007\/s10474-023-01312-y"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-95486-3_2","volume-title":"The Book of L","author":"J Berstel","year":"1986","unstructured":"Berstel, J.: Fibonacci words-a survey. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 13\u201327. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/978-3-642-95486-3_2"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Encyclopedia of Mathematics and Its Applications, vol. 137. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511760860"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)90274-E","volume":"24","author":"S Brlek","year":"1989","unstructured":"Brlek, S.: Enumeration of factors in the Thue-Morse word. Disc. Appl. Math. 24, 83\u201396 (1989)","journal-title":"Disc. Appl. Math."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and $$p$$-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 191\u2013238 (1994). Corrigendum, Bull. Belg. Math. Soc. 1, 577 (1994)","DOI":"10.36045\/bbms\/1103408547"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: Weak secord-order arithmetic and finite automata. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 6, 66\u201392 (1960). Reprinted in S. Mac Lane and D. Siefkes (eds.) The Collected Works of J. Richard B\u00fcchi, pp. 398\u2013424. Springer (1990)","DOI":"10.1007\/978-1-4613-8928-6_22"},{"issue":"66\u201381","key":"18_CR9","first-page":"133","volume":"3","author":"C Davis","year":"1970","unstructured":"Davis, C., Knuth, D.E.: Number representations and dragon curves-I, II. J. Recreational Math. 3(66\u201381), 133\u2013149 (1970)","journal-title":"J. Recreational Math."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","volume":"63","author":"A de Luca","year":"1989","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups. Theoret. Comput. Sci. 63, 333\u2013348 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4064\/aa103-2-3","volume":"103","author":"G Dombi","year":"2002","unstructured":"Dombi, G.: Additive properties of certain sets. Acta Arith 103, 137\u2013146 (2002)","journal-title":"Acta Arith"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.4171\/jems\/294","volume":"13","author":"F Durand","year":"2011","unstructured":"Durand, F.: Cobham\u2019s theorem for substitutions. J. Eur. Math. Soc. 13, 1799\u20131814 (2011)","journal-title":"J. Eur. Math. Soc."},{"key":"18_CR13","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"18_CR14","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":"18_CR15","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"18_CR16","unstructured":"Meleshko, J., Ochem, P., Shallit, J., Shan, S.L.: Pseudoperiodic words and a question of Shevelev (2022). arxiv preprint arXiv:2207.10171. https:\/\/arxiv.org\/abs\/2207.10171"},{"key":"18_CR17","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut (2016). arxiv preprint arXiv:1603.06017. http:\/\/arxiv.org\/abs\/1603.06017"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.24033\/bsmf.1957","volume":"110","author":"G Rauzy","year":"1982","unstructured":"Rauzy, G.: Nombres alg\u00e9briques et substitutions. Bull. Soc. Math. France 110, 147\u2013178 (1982)","journal-title":"Bull. Soc. Math. France"},{"key":"18_CR19","unstructured":"Reble, D.: Zeckendorf vs. Wythoff representations: comments on A007895 (2008). https:\/\/oeis.org\/A007895\/a007895.pdf"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1090\/S0002-9939-1959-0116184-5","volume":"10","author":"W Rudin","year":"1959","unstructured":"Rudin, W.: Some theorems on Fourier coefficients. Proc. Amer. Math. Soc. 10, 855\u2013859 (1959)","journal-title":"Proc. Amer. Math. Soc."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-85088-3_1","volume-title":"Combinatorics on Words","author":"J Shallit","year":"2021","unstructured":"Shallit, J.: Synchronized sequences. In: Lecroq, T., Puzynina, S. (eds.) WORDS 2021. LNCS, vol. 12847, pp. 1\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_1"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach To Automatic Sequences: Exploring Combinatorics on Words with Walnut, London Math. Society Lecture Note Series, vol. 482. Cambridge University Press, Cambridge (2022)","DOI":"10.1017\/9781108775267"},{"key":"18_CR23","unstructured":"Shallit, J.: Some Tribonacci conjectures (2023). arXiv preprint arXiv:2210.03996. https:\/\/arxiv.org\/abs\/2210.03996. To appear, Fibonacci Quart"},{"key":"18_CR24","unstructured":"Shapiro, H.S.: Extremal problems for polynomials and power series. Master\u2019s thesis, MIT (1952)"},{"key":"18_CR25","unstructured":"Shevelev, V.: Equations of the form $$t(x+a)=t(x)$$ and $$t(x+a) = 1-t(x)$$ for Thue-Morse sequence (2012). arxiv preprint arXiv:0907.0880. https:\/\/arxiv.org\/abs\/0907.0880"},{"key":"18_CR26","unstructured":"Sloane, N.J.A., et al.: The on-line encyclopedia of integer sequences (2023). https:\/\/oeis.org"},{"key":"18_CR27","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":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42753-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T10:47:59Z","timestamp":1703069279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}