{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:44:55Z","timestamp":1767033895596,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_21","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"278-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computing the k-binomial Complexity of the Thue\u2013Morse Word"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5620-8052","authenticated-orcid":false,"given":"Marie","family":"Lejeune","sequence":"first","affiliation":[]},{"given":"Julien","family":"Leroy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7463-8507","authenticated-orcid":false,"given":"Michel","family":"Rigo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"21_CR1","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4471-0551-0_1","volume-title":"Sequences and their Applications","author":"J-P Allouche","year":"1999","unstructured":"Allouche, J.-P., Shallit, J.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science, pp. 1\u201316. Springer, London (1999). https:\/\/doi.org\/10.1007\/978-1-4471-0551-0_1"},{"key":"21_CR2","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":"21_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(89)90302-6","volume":"76","author":"J Berstel","year":"1989","unstructured":"Berstel, J., Crochemore, M., Pin, J.-E.: Thue-Morse sequence and $$p$$ -adic topology for the free monoid. Discrete Math. 76, 89\u201394 (1989)","journal-title":"Discrete Math."},{"key":"21_CR4","series-title":"Encyclopedia Mathematics and Its Application","volume-title":"Combinatorics, Automata and Number Theory","year":"2010","unstructured":"Berth\u00e9, V., Rigo, M. (eds.): Combinatorics, Automata and Number Theory. Encyclopedia Mathematics and Its Application, vol. 135. Cambridge University Press, Cambridge (2010)"},{"key":"21_CR5","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. Discrete Appl. Math. 24, 83\u201396 (1989)","journal-title":"Discrete Appl. Math."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","volume":"63","author":"A Luca de","year":"1989","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups. Theor. Comput. Sci. 63, 333\u2013348 (1989)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Freydenberger, D.D., Gawrychowski, P., Karhum\u00e4ki, J., Manea, F., Rytter, W.: Testing $$k$$ -binomial equivalence. arXiv:1509.00622 (2015)","key":"21_CR7"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2015.05.047","volume":"593","author":"F Greinecker","year":"2015","unstructured":"Greinecker, F.: On the 2-abelian complexity of the Thue-Morse word. Theor. Comput. Sci. 593, 88\u2013105 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ipl.2014.11.008","volume":"115","author":"P Karandikar","year":"2015","unstructured":"Karandikar, P., Kufleitner, M., Schnoebelen, P.: On the index of Simon\u2019s congruence for piecewise testability. Inf. Process. Lett. 115, 515\u2013519 (2015)","journal-title":"Inf. Process. Lett."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. J. Combin. Theory Ser. A 120, 2189\u20132206 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-09698-8_18","volume-title":"Developments in Language Theory","author":"J Karhum\u00e4ki","year":"2014","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: Variations of the Morse-Hedlund theorem for k-abelian equivalence. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 203\u2013214. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09698-8_18"},{"unstructured":"Lejeune, M.: Au sujet de la complexit\u00e9 $$k$$ -binomiale. Master thesis, University of Li\u00e8ge (2018). http:\/\/hdl.handle.net\/2268.2\/5007","key":"21_CR12"},{"doi-asserted-by":"crossref","unstructured":"Lejeune, M., Leroy, J., Rigo, M.: Computing the $$k$$ -binomial complexity of the Thue-Morse word. arXiv:1812.07330 , 34 p. (2018)","key":"21_CR13","DOI":"10.1007\/978-3-030-24886-4_21"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.aam.2016.04.006","volume":"80","author":"J Leroy","year":"2016","unstructured":"Leroy, J., Rigo, M., Stipulanti, M.: Generalized Pascal triangle for binomial coefficients of words. Adv. Appl. Math. 80, 24\u201347 (2016)","journal-title":"Adv. Appl. Math."},{"key":"21_CR15","series-title":"Cambridge Mathematical Library","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"M Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics II. Sturmian trajectories. Am. J. Math. 62, 1\u201342 (1940)","journal-title":"Am. J. Math."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B Moss\u00e9","year":"1992","unstructured":"Moss\u00e9, B.: Puissances de mots et reconnaissabilit\u00e9 des points fixes d\u2019une substitution. Theor. Comput. Sci. 99, 327\u2013334 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.24033\/bsmf.2283","volume":"124","author":"B Moss\u00e9","year":"1996","unstructured":"Moss\u00e9, B.: Reconnaissabilit\u00e9 des substitutions et complexit\u00e9 des suites automatiques. Bull. Soc. Math. France 124, 329\u2013346 (1996)","journal-title":"Bull. Soc. Math. France"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.ejc.2013.09.009","volume":"36","author":"J\u00c9 Pin","year":"2014","unstructured":"Pin, J.\u00c9., Silva, P.V.: A noncommutative extension of Mahler\u2019s theorem on interpolation series. Eur. J. Combin. 36, 564\u2013578 (2014)","journal-title":"Eur. J. Combin."},{"key":"21_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/b13861","volume-title":"Substitutions in Dynamics, Arithmetics and Combinatorics","author":"N Pytheas Fogg","year":"2002","unstructured":"Pytheas Fogg, N., et al.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics, vol. 1794. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/b13861"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2015.01.029","volume":"572","author":"M Rao","year":"2015","unstructured":"Rao, M., Rigo, M., Salimov, P.: Avoiding $$2$$ -binomial squares and cubes. Theor. Comput. Sci. 572, 83\u201391 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR22","series-title":"Network and Telecommunications Series","volume-title":"Formal Languages, Automata and Numeration Systems 1, Introduction to Combinatorics on Words","author":"M Rigo","year":"2014","unstructured":"Rigo, M.: Formal Languages, Automata and Numeration Systems 1, Introduction to Combinatorics on Words. Network and Telecommunications Series. ISTE-Wiley, London (2014)"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2015.07.025","volume":"601","author":"M Rigo","year":"2015","unstructured":"Rigo, M., Salimov, P.: Another generalization of abelian equivalence: binomial complexity of infinite words. Theor. Comput. Sci. 601, 47\u201357 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.indag.2016.11.018","volume":"28","author":"M Rigo","year":"2017","unstructured":"Rigo, M.: Relations on words. Indag. Math. (N.S.) 28, 183\u2013204 (2017)","journal-title":"Indag. Math. (N.S.)"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1070\/IM2000v064n04ABEH000301","volume":"64","author":"AM Shur","year":"2000","unstructured":"Shur, A.M.: The structure of the set of cube-free words over a two-letter alphabet. Izv. Math. 64, 847\u2013871 (2000)","journal-title":"Izv. Math."},{"key":"21_CR26","first-page":"78","volume":"12","author":"AM Shur","year":"2005","unstructured":"Shur, A.M.: Combinatorial complexity of rational languages. Diskretn. Anal. Issled. Oper. Ser. 1 12, 78\u201399 (2005). (Russian)","journal-title":"Diskretn. Anal. Issled. Oper. Ser. 1"},{"unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 10, Christiana (1912)","key":"21_CR27"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T05:37:18Z","timestamp":1575437838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"0","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":"67% - 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":"2","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)"}}]}}