{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T10:30:47Z","timestamp":1775644247786,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551249","type":"print"},{"value":"9783540467373","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55124-7_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:48:42Z","timestamp":1330249722000},"page":"85-150","source":"Crossref","is-referenced-by-count":40,"title":["Makanin's algorithm for word equations-two improvements and a generalization"],"prefix":"10.1007","author":[{"given":"Klaus U.","family":"Schulz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"4_CR1","volume-title":"Th\u00e8se de doctorat","author":"H. Abdulrab","year":"1987","unstructured":"H.Abdulrab, R\u00e9solution d'\u00e9quations sur les mots: Etude et impl\u00e9mentation LISP de l'algorithme de MAKANIN, Th\u00e8se de doctorat-Laboratoire d'informatique, Rouen 1987."},{"key":"4_CR2","unstructured":"V.K.Bulitko, Equations and Inequalities in a Free Group and a Free Semigroup, Tul. Cos. Ped. Inst. U\u010den. Zap. Mat. Kafedr Vyp.2, Geometr. i Algebra (1970), pp. 242\u2013252 (Russian)."},{"key":"4_CR3","first-page":"82","volume":"7","author":"D. C. Cooper","year":"1972","unstructured":"D.C.Cooper, Theorem-proving in Arithmetic without Multiplication, Machine Intelligence 7 (1972), 82\u201395.","journal-title":"Machine Intelligence"},{"key":"4_CR4","first-page":"82","volume":"2","author":"Z. Farkas","year":"1987","unstructured":"Z.Farkas, Listlog \u2014 A Prolog Extension for List Processing, Proc. TAPSOFT 1987, March 1987, LNCS 250, Vol. 2, 82\u201395.","journal-title":"LNCS 250"},{"key":"4_CR5","unstructured":"L.Fribourg, List Concatenation via Extended Unification, Programmation en Logique, Actes du S\u00e9minaire 1987, Tr\u00e9gastel 1987, 45\u201359."},{"key":"#cr-split#-4_CR6.1","unstructured":"J.I.Hmelevskii, Equations in Free Semigroups, Trudy Mat. Inst. Steklov. 107 (1971);"},{"key":"#cr-split#-4_CR6.2","unstructured":"English transl. Proc. Steklov Inst. Math. 107 (1971)."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"J.Jaffar, Minimal and Complete Word Unification, JACM 37 (1), 47\u201385.","DOI":"10.1145\/78935.78938"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"A.Ko\u015bcielski,L.Pacholski, Complexity of Unification in free groups and free semigroups, Proc. 3st Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos 1990, 824\u2013829.","DOI":"10.1109\/FSCS.1990.89605"},{"key":"4_CR9","first-page":"67","volume-title":"Automata Languages and Programming","author":"A. Lentin","year":"1972","unstructured":"A.Lentin, Equations in Free Monoids, in Automata Languages and Programming, (M. Nivat, ed.) North Holland Publishers, Amsterdam 1972, 67\u201385."},{"key":"4_CR10","unstructured":"A.Lentin,M.P.Sch\u00fctzenberger, A Combinatorial Problem in the Theory of Free Monoids, Proc. of the University of North-Carolina (1967), 128\u2013144."},{"key":"4_CR11","unstructured":"M.Livesey,J.Siekmann, Termination and Decidability Results for String Unification, Essex University, Memo, 1975."},{"key":"4_CR12","unstructured":"M.Lothaire, Combinatorics on words, Addison Wesley, 1983."},{"issue":"2","key":"4_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. S. Makanin","year":"1977","unstructured":"G.S.Makanin, The problem of solvability of equations in a free semigroup, Math. USSR Sbornik 32, 2 (1977), 129\u2013198.","journal-title":"Math. USSR Sbornik"},{"issue":"3","key":"4_CR14","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1070\/IM1980v014n03ABEH001143","volume":"14","author":"G. S. Makanin","year":"1980","unstructured":"G.S.Makanin, Recognition of the Rank of Equations in a Free Semigroup, Math. USSR Izvestija 14, 3 (1980), 499\u2013545.","journal-title":"Math. USSR Izvestija"},{"key":"4_CR15","volume-title":"Th\u00e8se de doctorat","author":"J. P. P\u00e9cuchet","year":"1981","unstructured":"J.P.P\u00e9cuchet, Equations avec constantes et algorithme de Makanin, Th\u00e8se de doctorat, Laboratoire d' informatique, Rouen 1981."},{"key":"4_CR16","first-page":"73","volume":"7","author":"G. Plotkin","year":"1972","unstructured":"G.Plotkin, Building-in Equational Theories, Machine Intelligence 7 (1972), 73\u201390.","journal-title":"Machine Intelligence"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J.A.Robinson, A Machine-Oriented Logic based on the Resolution Principle, Journal of the ACM 12 (1965), 32\u201341.","journal-title":"Journal of the ACM"},{"key":"4_CR18","unstructured":"A.Roussel, Programmation de l'algorithme de Makanin en PROLOG II, Memoire de D.E.A., Universit\u00e9 Aix-Marseille II, 1987."},{"key":"4_CR19","unstructured":"K.U.Schulz, A Guide to Makanin's Algorithm, SNS-Bericht 88-39, Seminar f\u00fcr nat\u00fcrlich-sprachliche Systeme, University of T\u00fcbingen 1989."},{"key":"4_CR20","unstructured":"K.U.Schulz, A Note on Makanin's Algorithm, SNS-Bericht 89-53, Seminar f\u00fcr nat\u00fcrlich-sprachliche Systeme, University of T\u00fcbingen 1989."},{"key":"4_CR21","unstructured":"K.U.Schulz, Makanin's Algorithm \u2014 Two Improvements and a Generalization, CIS-Report 91-39, Centrum f\u00fcr Informations-und Sprachverarbeitung, University of Munique,1991."},{"key":"4_CR22","unstructured":"J.Siekmannn, A Modification of Robinson's Unification Procedure, M.Sc.Thesis, 1972."},{"key":"4_CR23","unstructured":"J. Siekmannn, Unification and Matching Problems, Ph.D.Thesis, Essex University, Memo CSA-4-78, 1978."}],"container-title":["Lecture Notes in Computer Science","Word Equations and Related Topics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55124-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:30:22Z","timestamp":1742592622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55124-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551249","9783540467373"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55124-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}