{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:22:07Z","timestamp":1747153327518,"version":"3.40.5"},"publisher-location":"Cham","reference-count":18,"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_20","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Solution Sets of\u00a0Entire Systems of\u00a0Word Equations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6636-2317","authenticated-orcid":false,"given":"Aleksi","family":"Saarela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"1","key":"20_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. Theoret. Comput. Sci. 41(1), 121\u2013123 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90066-0","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR2","first-page":"267","volume":"14","author":"LG Budkina","year":"1973","unstructured":"Budkina, L.G., Markov, A.A.: $$F$$-semigroups with three generators. Akademiya Nauk SSSR. Matematicheskie Zametki 14, 267\u2013277 (1973)","journal-title":"Akademiya Nauk SSSR. Matematicheskie Zametki"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Society 16, 109\u2013114 (1965). https:\/\/doi.org\/10.1090\/S0002-9939-1965-0174934-9","journal-title":"Proc. Am. Math. Society"},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01142470","volume":"40","author":"VS Guba","year":"1986","unstructured":"Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Matematicheskie Zametki 40(3), 321\u2013324 (1986). https:\/\/doi.org\/10.1007\/BF01142470","journal-title":"Matematicheskie Zametki"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0304-3975(03)00098-7","volume":"307","author":"T Harju","year":"2003","unstructured":"Harju, T., Nowotka, D.: On the independence of equations in three variables. Theoret. Comput. Sci. 307(1), 139\u2013172 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00098-7","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR6","unstructured":"Hmelevski\u012d, J.I.: Equations in free semigroups. American Mathematical Society (1976), translated by G. A. Kandall from the Russian original: Trudy Mat. Inst. Steklov. 107 (1971)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2021.08.001","volume":"123","author":"A Je\u017c","year":"2022","unstructured":"Je\u017c, A.: Word equations in non-deterministic linear space. J. Comput. Syst. Sci. 123, 122\u2013142 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2021.08.001","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-85780-8_37","volume-title":"Developments in Language Theory","author":"J Karhum\u00e4ki","year":"2008","unstructured":"Karhum\u00e4ki, J., Saarela, A.: An analysis and a reproof of Hmelevskii\u2019s Theorem. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 467\u2013478. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85780-8_37"},{"key":"20_CR9","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley (1983)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002) http:\/\/www-igm.univ-mlv.fr\/berstel\/Lothaire\/AlgCWContents.html","DOI":"10.1017\/CBO9781107326019"},{"issue":"5","key":"20_CR11","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1142\/S0129054118420121","volume":"29","author":"D Nowotka","year":"2018","unstructured":"Nowotka, D., Saarela, A.: One-variable word equations and three-variable constant-free word equations. Int. J. Found. Comput. Sci. 29(5), 935\u2013950 (2018). https:\/\/doi.org\/10.1142\/S0129054118420121","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/20M1310448","volume":"51","author":"D Nowotka","year":"2022","unstructured":"Nowotka, D., Saarela, A.: An optimal bound on the solution sets of one-variable word equations and its consequences. SIAM J. Comput. 51(1), 1\u201318 (2022). https:\/\/doi.org\/10.1137\/20M1310448","journal-title":"SIAM J. Comput."},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-02737-6_36","volume-title":"Developments in Language Theory","author":"A Saarela","year":"2009","unstructured":"Saarela, A.: On the complexity of Hmelevskii\u2019s theorem and satisfiability of three unknown equations. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 443\u2013453. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_36"},{"key":"20_CR14","unstructured":"Saarela, A.: Word equations and related topics: independence, decidability and characterizations (2012) http:\/\/urn.fi\/URN:ISBN:978-952-12-2737-0 doctoral dissertation, University of Turku"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2015.01.005","volume":"47","author":"A Saarela","year":"2015","unstructured":"Saarela, A.: Systems of word equations, polynomials and linear algebra: a new approach. Eur. J. Comb. 47, 1\u201314 (2015). https:\/\/doi.org\/10.1016\/j.ejc.2015.01.005","journal-title":"Eur. J. Comb."},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Saarela, A.: Hardness results for constant-free pattern languages and word equations. In: Proceedings of the 47th ICALP. LIPIcs, vol. 168, pp. 140:1\u2013140:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.140","DOI":"10.4230\/LIPIcs.ICALP.2020.140"},{"key":"20_CR17","unstructured":"Spehner, J.C.: Quelques probl\u00e9mes d\u2019extension, de conjugaison et de pr\u00e9sentation des sous-mono\u00efdes d\u2019un mono\u00efde libre. Ph.D. thesis, Univ. Paris (1976)"},{"key":"20_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BFb0083443","volume-title":"Semigroups Theory and Applications","author":"J-C Spehner","year":"1988","unstructured":"Spehner, J.-C.: Les systemes entiers d\u2019equations sur un alphabet de 3 variables. In: J\u00fcrgensen, H., Lallement, G., Weinert, H.J. (eds.) Semigroups Theory and Applications. LNM, vol. 1320, pp. 342\u2013357. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0083443"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:05:54Z","timestamp":1685487954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_20","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)"}}]}}