{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:26:13Z","timestamp":1743132373728,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850876"},{"type":"electronic","value":"9783030850883"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_16","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"185-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equations over the k-Binomial Monoids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6006-9902","authenticated-orcid":false,"given":"Markus A.","family":"Whiteland","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(85)90066-0","volume":"41","author":"MH Albert","year":"1985","unstructured":"Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht\u2019s conjecture. Theor. Comput. Sci. 41, 121\u2013123 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90066-0","journal-title":"Theor. Comput. Sci."},{"key":"16_CR2","unstructured":"Amadini, R.: A survey on string constraint solving (2021) https:\/\/arxiv.org\/abs\/2002.02376v4"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-00250-3_2","volume-title":"Reachability Problems","author":"JD Day","year":"2018","unstructured":"Day, J.D., Ganesh, V., He, P., Manea, F., Nowotka, D.: The satisfiability of word equations: decidable and undecidable theories. In: Potapov, I., Reynier, P.-A. (eds.) RP 2018. LNCS, vol. 11123, pp. 15\u201329. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00250-3_2"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Matematicheskie Zametki 40(3), 321\u2013324, 428 (1986). in Russian","DOI":"10.1007\/BF01142470"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0218196797000204","volume":"7","author":"T Harju","year":"1997","unstructured":"Harju, T., Karhum\u00e4ki, J., Plandowski, W.: Compactness of systems of equations in semigroups. Int. J. Algebra Comput. 7(4), 457\u2013470 (1997). https:\/\/doi.org\/10.1142\/S0218196797000204","journal-title":"Int. J. Algebra Comput."},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Je\u017c, A.: Solving word equations (and other unification problems) by recompression (invited talk). In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 152, pp. 3:1\u20133:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.3","DOI":"10.4230\/LIPIcs.CSL.2020.3"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-3975(96)00064-3","volume":"168","author":"J Karhum\u00e4ki","year":"1996","unstructured":"Karhum\u00e4ki, J., Plandowski, W.: On the size of independent systems of equations in semigroups. Theor. Comput. Sci. 168(1), 105\u2013119 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(96)00064-3","journal-title":"Theor. Comput. Sci."},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Karhum\u00e4ki, J., Whiteland, M.A.: A compactness property of the k-abelian monoids. Theor. Comput. Sci. 834, 3\u201313 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.01.023","DOI":"10.1016\/j.tcs.2020.01.023"},{"key":"16_CR9","first-page":"34","volume":"28","author":"J Lawrence","year":"1986","unstructured":"Lawrence, J.: The non-existence of finite test sets for set-equivalence of finite substitutions. Bull. EATCS 28, 34\u201336 (1986)","journal-title":"Bull. EATCS"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Lejeune, M., Rigo, M., Rosenfeld, M.: The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30(07), 1375\u20131397 (2020). https:\/\/doi.org\/10.1142\/s0218196720500459","DOI":"10.1142\/s0218196720500459"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Lejeune, M., Rigo, M., Rosenfeld, M.: Templates for the k-binomial complexity of the tribonacci word. Adv. Appl. Math. 112 (2020). https:\/\/doi.org\/10.1016\/j.aam.2019.101947","DOI":"10.1016\/j.aam.2019.101947"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-030-01090-4_21","volume-title":"Automated Technology for Verification and Analysis","author":"AW Lin","year":"2018","unstructured":"Lin, A.W., Majumdar, R.: Quadratic word equations with length constraints, counter systems, and presburger arithmetic with divisibility. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 352\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_21"},{"key":"16_CR13","series-title":"Advanced Book Program, World Science Division","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications. Advanced Book Program, World Science Division, vol. 17. Addison-Wesley, Boston (1983)"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9781107326019","DOI":"10.1017\/CBO9781107326019"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Nowotka, D., Saarela, A.: An optimal bound on the solution sets of one-variable word equations and its consequences. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, pp. 136:1\u2013136:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.136","DOI":"10.4230\/LIPIcs.ICALP.2018.136"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Nowotka, D., Saarela, A.: One-variable word equations and three-variable constant-free word equations. Int. J. Found. Comput. Sci. 29(5) (2018). https:\/\/doi.org\/10.1142\/S0129054118420121","DOI":"10.1142\/S0129054118420121"},{"key":"16_CR17","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). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.029","journal-title":"Theor. Comput. Sci."},{"key":"16_CR18","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). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.025","journal-title":"Theor. Comput. Sci."},{"key":"16_CR19","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken (1999)"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/s10469-015-9345-6","volume":"54","author":"A Shevlyakov","year":"2015","unstructured":"Shevlyakov, A.: Elements of algebraic geometry over a free semilattice. Algebra Logic 54(3), 258\u2013271 (2015). https:\/\/doi.org\/10.1007\/s10469-015-9345-6","journal-title":"Algebra Logic"},{"key":"16_CR21","unstructured":"Whiteland, M.A.: On the $$k$$-abelian Equivalence Relation of Finite Words. TUCS Dissertations, vol. 241. Turku Centre for Computer Science (2019). https:\/\/urn.fi\/URN:ISBN:978-952-12-3837-6, PhD Dissertation (University of Turku)"}],"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-85088-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:04:40Z","timestamp":1630883080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","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":"18","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":"11","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":"3","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":"61% - 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)"}},{"value":"2 invited papers are also included","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)"}}]}}