{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:34:46Z","timestamp":1743143686760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030287955"},{"type":"electronic","value":"9783030287962"}],"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-28796-2_19","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"238-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Templates for the k-Binomial Complexity of the Tribonacci Word"],"prefix":"10.1007","author":[{"given":"Marie","family":"Lejeune","sequence":"first","affiliation":[]},{"given":"Michel","family":"Rigo","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Rosenfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2008.09.027","volume":"410","author":"A Aberkane","year":"2009","unstructured":"Aberkane, A., Currie, J.: A cyclic binary morphism avoiding abelian fourth powers. Theoret. Comput. Sci. 410, 44\u201352 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR2","unstructured":"Aberkane, A., Currie, J., Rampersad, N.: The number of ternary words avoiding abelian cubes grows exponentially. J. Integer Seq. 7 (2004). Article 04.2.7"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences. Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9780511546563"},{"volume-title":"Combinatorics, Automata and Number Theory","year":"2009","key":"19_CR4","unstructured":"Berth\u00e9, V., Rigo, M. (eds.): Combinatorics, Automata and Number Theory. Encyclopedia Mathematics Applications, vol. 135. Cambridge University Press, Cambridge (2010)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2590775","volume":"61","author":"Julien Cassaigne","year":"2014","unstructured":"Cassaigne, J., Currie, J., Schaeffer, L., Shallit, J.: Avoiding three consecutive blocks of the same size and same sum. J. ACM 61(2) (2014). Art. 10","journal-title":"Journal of the ACM"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1142\/S0129054111008489","volume":"22","author":"J Cassaigne","year":"2011","unstructured":"Cassaigne, J., Richomme, G., Saari, K., Zamboni, L.Q.: Avoiding Abelian powers in binary words with bounded Abelian complexity. Int. J. Found. Comput. Sci. 22, 905\u2013920 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.aam.2010.05.001","volume":"47","author":"J Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: Recurrent words with constant Abelian complexity. Adv. Appl. Math. 47, 116\u2013124 (2011)","journal-title":"Adv. Appl. Math."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1016\/j.jcta.2012.01.006","volume":"119","author":"J Currie","year":"2012","unstructured":"Currie, J., Rampersad, N.: Fixed points avoiding Abelian $$k$$-powers. J. Combin. Theory Ser. A 119, 942\u2013948 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"key":"19_CR9","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":"19_CR10","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"},{"key":"19_CR11","unstructured":"Lejeune, M., Leroy, J., Rigo, M.: Computing the $$k$$-binomial complexity of the Thue-Morse word, 34 p. arXiv:1812.07330"},{"key":"19_CR12","unstructured":"Lejeune, M., Rigo, M., Rosenfeld, M.: Templates for the $$k$$-binomial complexity of the Tribonacci word (long version), 23 p. http:\/\/hdl.handle.net\/2268\/234215"},{"key":"19_CR13","unstructured":"Li\u00e9tard, F.: Avoiding additive powers, talk at Mons TCS days, Bordeaux, 10\u201314 September 2018"},{"key":"19_CR14","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. Theoret. Comput. Sci. 572, 83\u201391 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"2381","DOI":"10.1137\/17M1149377","volume":"32","author":"M Rao","year":"2018","unstructured":"Rao, M., Rosenfeld, M.: Avoiding two consecutive blocks of same size and same sum over $$\\mathbb{Z}^2$$. SIAM J. Disc. Math. 32(4), 2381\u20132397 (2018)","journal-title":"SIAM J. Disc. Math."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.aam.2010.01.006","volume":"45","author":"G Richomme","year":"2010","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45, 212\u2013231 (2010)","journal-title":"Adv. Appl. Math."},{"key":"19_CR17","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. Theoret. Comput. Sci. 601, 47\u201357 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR18","unstructured":"Rigo, M.: Invited talk. Streams II, Lorentz Center, Leiden, January 2014"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.indag.2016.11.018","volume":"28","author":"Michel Rigo","year":"2017","unstructured":"Rigo, M.: Relations on words. Indag. Math. (N.S.) 28, 183\u2013204 (2017)","journal-title":"Indagationes Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28796-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:47:49Z","timestamp":1710251269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_19","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":"9 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/words2019.lboro.ac.uk\/","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":"34","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":"21","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":"62% - 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":"7","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)"}}]}}