{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:17Z","timestamp":1759638857352,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331794"},{"type":"electronic","value":"9783031331800"}],"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-33180-0_11","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"143-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On a\u00a0Class of\u00a02-Balanced Sequences"],"prefix":"10.1007","author":[{"given":"L\u2019ubom\u00edra","family":"Dvo\u0159\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ma\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edita","family":"Pelantov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00092-6","volume":"307","author":"B Adamczewski","year":"2003","unstructured":"Adamczewski, B.: Balances for fixed points of primitive substitutions. Theoret. Comput. Sci. 307, 47\u201375 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR2","volume-title":"Further developments in fractals and related fields (The Rauzy gasket)","author":"P Arnoux","year":"2013","unstructured":"Arnoux, P., Starosta, \u0160: Further developments in fractals and related fields (The Rauzy gasket). Birkh\u00e4user\/Springer, Boston (2013)"},{"issue":"04","key":"11_CR3","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1142\/S0218196713400043","volume":"23","author":"V Berth\u00e9","year":"2013","unstructured":"Berth\u00e9, V., Cassaigne, J., Steiner, W.: Balance properties of Arnoux-Rauzy sequences. Int. J. Algebra Comput. 23(04), 689\u2013703 (2013)","journal-title":"Int. J. Algebra Comput."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2140\/moscow.2022.11.287","volume":"11","author":"J Cassaigne","year":"2022","unstructured":"Cassaigne, J., Labb\u00e9, S., Leroy, J.: Almost everywhere balanced sequences of complexity $$2n+1$$. Mosc. J. Comb. Number Theory 11(4), 287\u2013333 (2022)","journal-title":"Mosc. J. Comb. Number Theory"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"EM Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Syst. Theory 7, 138\u2013153 (1973)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"11_CR6","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(1), 116\u2013124 (2011)","journal-title":"Adv. Appl. Math."},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2022.100532","volume":"47","author":"G Fici","year":"2023","unstructured":"Fici, G., Puzynina, S.: Abelian combinatorics on words: A survey. Comput. Sci. Rev. 47, 100532 (2023)","journal-title":"Comput. Sci. Rev."},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"issue":"1\u20132","key":"11_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(98)00202-3","volume":"242","author":"P Hubert","year":"2000","unstructured":"Hubert, P.: Suites \u00e9quilibr\u00e9es. Theoret. Comput. Sci. 242(1\u20132), 91\u2013108 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Langeveld, N., Rossi, L., Thuswaldner, J.M.: Generalizations of Sturmian sequences associated with $$N$$-continued fraction algorithms. J. Number Theor. 250, 49\u201383 (2023)","DOI":"10.1016\/j.jnt.2023.03.008"},{"key":"11_CR11","first-page":"1","volume":"62","author":"M Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.A.: Amer. J. Math. Symbolic Dynamics II. Sturmian trajectories 62, 1\u201342 (1940)","journal-title":"Sturmian trajectories"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02020954","volume":"11","author":"W Parry","year":"1960","unstructured":"Parry, W.: On the $$\\beta $$ expansion of real numbers. Acta Mathematica Academiae Scientiarum Hungaricae 11, 401\u2013416 (1960)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1112\/jlms\/jdq063","volume":"83","author":"G Richomme","year":"2010","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Abelian complexity of minimal subshifts. J. London Math. Soc. 83(1), 79\u201395 (2010)","journal-title":"J. London Math. Soc."},{"issue":"3\/4","key":"11_CR14","first-page":"255","volume":"14","author":"A Saarela","year":"2009","unstructured":"Saarela, A.: Ultimately constant abelian complexity of infinite words. J. Autom. Lang. Comb. 14(3\/4), 255\u2013258 (2009)","journal-title":"J. Autom. Lang. Comb."}],"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-031-33180-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:04:34Z","timestamp":1685487874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_11","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":"31 May 2023","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":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"19","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":"68% - 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":"2.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":"5","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)"}},{"value":"3 Invited papers included in this proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}