{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:19:49Z","timestamp":1775053189505,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540857792","type":"print"},{"value":"9783540857808","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_37","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"467-478","source":"Crossref","is-referenced-by-count":5,"title":["An Analysis and a Reproof of Hmelevskii\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(85)90066-0","volume":"41","author":"M.H. Albert","year":"1985","unstructured":"Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht\u2019s Conjecture. Theoret. Comput. Sci.\u00a041, 121\u2013123 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR2","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"key":"37_CR3","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. Internat. J. Found. Comput. Sci.\u00a018, 873\u2013897 (2007)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"37_CR4","first-page":"321","volume":"40","author":"V.S. Guba","year":"1986","unstructured":"Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Mat. Zametki\u00a040, 321\u2013324 (1986)","journal-title":"Mat. Zametki"},{"key":"37_CR5","volume-title":"Algebraic Combinatorics on Words","author":"T. Harju","year":"2002","unstructured":"Harju, T., Karhum\u00e4ki, J., Plandowski, W.: Independent system of equations. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"#cr-split#-37_CR6.1","unstructured":"Hmelevskii, Y.I.: Equations in free semigroups. Proc. Steklov Inst. of Math.\u00a0107 (1971)"},{"key":"#cr-split#-37_CR6.2","unstructured":"Amer. Math. Soc. Translations (1976)"},{"key":"37_CR7","unstructured":"Karhum\u00e4ki, J., Saarela, A.: A Reproof of Hmelevskii\u2019s Theorem (manuscript)"},{"key":"37_CR8","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"37_CR9","first-page":"147","volume":"103","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Mat. Sb.\u00a0103, 147\u2013236 (1977); English transl. in Math. USSR Sb. 32, 129\u2013198","journal-title":"Mat. Sb."},{"key":"37_CR10","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\u00a051, 483\u2013496 (2004)","journal-title":"J. ACM"},{"key":"37_CR11","unstructured":"Spehner, J.-C.: Quelques Problemes d\u2019extension, de conjugaison et de presentation des sous-monoides d\u2019un monoide libre. Ph.D. Thesis, Univ. Paris (1976)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Spehner, J.-C.: Les presentations des sous-monoides de rang 3 d\u2019un monoide libre. In: Semigroups, Proc. Conf. Math. Res. Inst., pp. 116\u2013155 (1978)","DOI":"10.1007\/BFb0089813"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:59:02Z","timestamp":1676055542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_37"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}