{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:37:55Z","timestamp":1743125875401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_4","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"60-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Independent Systems of Word Equations: From Ehrenfeucht to Eighteen"],"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":[[2019,8,9]]},"reference":[{"issue":"1","key":"4_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":"4_CR2","first-page":"267","volume":"14","author":"LG Budkina","year":"1973","unstructured":"Budkina, L.G., Markov, A.A.: $$F$$-semigroups with three generators. Mat. Zametki 14, 267\u2013277 (1973)","journal-title":"Mat. Zametki"},{"issue":"2\u20133","key":"4_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(83)90152-8","volume":"43","author":"K Culik II","year":"1983","unstructured":"Culik II, K., Karhum\u00e4ki, J.: Systems of equations over a free monoid and Ehrenfeucht\u2019s conjecture. Discrete Math. 43(2\u20133), 139\u2013153 (1983). https:\/\/doi.org\/10.1016\/0012-365X(83)90152-8","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2007.10.026","volume":"391","author":"E Czeizler","year":"2008","unstructured":"Czeizler, E.: Multiple constraints on three and four words. Theoret. Comput. Sci. 391(1\u20132), 14\u201319 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.10.026","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1142\/S0129054107005030","volume":"18","author":"E Czeizler","year":"2007","unstructured":"Czeizler, E., Karhum\u00e4ki, J.: On non-periodic solutions of independent systems of word equations over three unknowns. Int. J. Found. Comput. Sci. 18(4), 873\u2013897 (2007). https:\/\/doi.org\/10.1142\/S0129054107005030","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"30\u201332","key":"4_CR6","doi-asserted-by":"publisher","first-page":"2889","DOI":"10.1016\/j.tcs.2009.01.023","volume":"410","author":"E Czeizler","year":"2009","unstructured":"Czeizler, E., Plandowski, W.: On systems of word equations over three unknowns with at most six occurrences of one of the unknowns. Theoret. Comput. Sci. 410(30\u201332), 2889\u20132909 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.023","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s00453-009-9375-3","volume":"60","author":"Robert D\u0105browski","year":"2009","unstructured":"Da\u0327browski, R., Plandowski, W.: On word equations in one variable. Algorithmica 60(4), 819\u2013828 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9375-3","journal-title":"Algorithmica"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-58338-6_80","volume-title":"Mathematical Foundations of Computer Science 1994","author":"SE Obono","year":"1994","unstructured":"Obono, S.E., Goralcik, P., Maksimenko, M.: Efficient solving of the word equations in one variable. In: Pr\u00edvara, I., Rovan, B., Ruzi\u010dka, P. (eds.) MFCS 1994. LNCS, vol. 841, pp. 336\u2013341. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58338-6_80"},{"issue":"3","key":"4_CR9","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. Mat. Zametki 40(3), 321\u2013324 (1986). https:\/\/doi.org\/10.1007\/BF01142470","journal-title":"Mat. Zametki"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s002360050081","volume":"34","author":"I Hakala","year":"1997","unstructured":"Hakala, I., Kortelainen, J.: On the system of word equations $$x^i_1x^i_2\\cdots x^i_m=y^i_1y^i_2\\cdots y^i_n$$$$(i=1,2,\\cdots )$$ in a free monoid. Acta Inform. 34(3), 217\u2013230 (1997). https:\/\/doi.org\/10.1007\/s002360050081","journal-title":"Acta Inform."},{"key":"4_CR11","first-page":"443","volume-title":"Algebraic Combinatorics on Words","author":"T Harju","year":"2002","unstructured":"Harju, T., Karhum\u00e4ki, J., Plandowski, W.: Independent systems of equations. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, pp. 443\u2013472. Cambridge University Press, Cambridge (2002)"},{"issue":"1","key":"4_CR12","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."},{"issue":"1\u20132","key":"4_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00156-0","volume":"262","author":"\u0160 Holub","year":"2001","unstructured":"Holub, \u0160.: Local and global cyclicity in free semigroups. Theoret. Comput. Sci. 262(1\u20132), 25\u201336 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00156-0","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.jalgebra.2015.03.021","volume":"434","author":"\u0160 Holub","year":"2015","unstructured":"Holub, \u0160., \u017demli\u010dka, J.: Algebraic properties of word equations. J. Algebra 434, 283\u2013301 (2015). https:\/\/doi.org\/10.1016\/j.jalgebra.2015.03.021","journal-title":"J. Algebra"},{"key":"4_CR15","first-page":"157","volume":"68","author":"J Honkala","year":"1999","unstructured":"Honkala, J.: On chains of word equations and test sets. Bull. EATCS 68, 157\u2013160 (1999)","journal-title":"Bull. EATCS"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2743014","volume":"63","author":"Artur Je\u017c","year":"2016","unstructured":"Je\u017c, A.: Recompression: a simple and powerful technique for word equations. J. ACM 63(1), Art. 4, 51 (2016). https:\/\/doi.org\/10.1145\/2743014","journal-title":"Journal of the ACM"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1142\/9789814447133_0012","volume-title":"Mathematical Aspects of Natural and Formal Languages","author":"Juhani KARHUM\u00c4KI","year":"1994","unstructured":"Karhum\u00e4ki, J., Plandowski, W.: On the defect effect of many identities in free semigroups. In: Paun, G. (ed.) Mathematical Aspects of Natural and Formal Languages, pp. 225\u2013232. World Scientific (1994). https:\/\/doi.org\/10.1142\/9789814447133_0012"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1134\/S0081543811060083","volume":"274","author":"J Karhum\u00e4ki","year":"2011","unstructured":"Karhum\u00e4ki, J., Saarela, A.: On maximal chains of systems of word equations. Proc. Steklov Inst. Math. 274, 116\u2013123 (2011). https:\/\/doi.org\/10.1134\/S0081543811060083","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1142\/S0129054111008088","volume":"22","author":"M Laine","year":"2011","unstructured":"Laine, M., Plandowski, W.: Word equations with one unknown. Int. J. Found. Comput. Sci. 22(2), 345\u2013375 (2011). https:\/\/doi.org\/10.1142\/S0129054111008088","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Makanin, G.S.: The problem of the solvability of equations in a free semigroup. Mat. Sb. (N.S.) 103(2), 147\u2013236 (1977). English translation in Math. USSR Sb. 32, 129\u2013198 (1977)","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-662-53132-7_27","volume-title":"Developments in Language Theory","author":"D Nowotka","year":"2016","unstructured":"Nowotka, D., Saarela, A.: One-unknown word equations and three-unknown constant-free word equations. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 332\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53132-7_27"},{"issue":"5","key":"4_CR22","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."},{"key":"4_CR23","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: Proceedings of the 45th ICALP. LIPIcs, vol. 107, pp. 136:1\u2013136:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.136","DOI":"10.4230\/LIPIcs.ICALP.2018.136"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45007-6_6","volume-title":"Developments in Language Theory","author":"W Plandowski","year":"2003","unstructured":"Plandowski, W.: Test sets for large families of languages. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 75\u201394. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45007-6_6"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/990308.990312","volume":"51","author":"W Plandowski","year":"2004","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3), 483\u2013496 (2004)","journal-title":"J. ACM"},{"key":"4_CR26","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":"4_CR27","doi-asserted-by":"publisher","unstructured":"Saarela, A.: Word equations where a power equals a product of powers. In: Proceedings of the 34th STACS. LIPIcs, vol. 66, pp. 55:1\u201355:9. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.55","DOI":"10.4230\/LIPIcs.STACS.2017.55"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jcta.2019.01.004","volume":"165","author":"A Saarela","year":"2019","unstructured":"Saarela, A.: Word equations with $$k$$th powers of variables. J. Comb. Theory Ser. A 165, 15\u201331 (2019). https:\/\/doi.org\/10.1016\/j.jcta.2019.01.004","journal-title":"J. Comb. Theory Ser. A"},{"key":"4_CR29","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":"4_CR30","doi-asserted-by":"crossref","unstructured":"Spehner, J.C.: Les systemes entiers d\u2019\u00e9quations sur un alphabet de 3 variables. In: Semigroups, pp. 342\u2013357 (1986)","DOI":"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-030-28796-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:18:01Z","timestamp":1710249481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_4","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)"}}]}}