{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T10:30:05Z","timestamp":1775644205449,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5099,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1016\/s0304-3975(98)00313-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"215-235","source":"Crossref","is-referenced-by-count":12,"title":["Solving word equations modulo partial commutations"],"prefix":"10.1016","volume":"224","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Matiyasevich","sequence":"additional","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00313-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02088289","article-title":"Characterizations of the decidability of some problems for regular trace languages","volume":"22","author":"Aalbersberg","year":"1989","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(91)90224-6","article-title":"The parallel complexity of two problems on concurrency","volume":"38","author":"\u00c0lvarez","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00313-2_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF00993053","article-title":"Inhomogeneous sorting","volume":"8","author":"Anisimov","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/S0304-3975(98)00313-2_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/malq.19880340410","article-title":"Definability in the existential theory of concatenation and undecidable extensions of this theory","volume":"34","author":"B\u00fcchi","year":"1988","journal-title":"Z. Math. Logik Grundlagen d. Math."},{"key":"10.1016\/S0304-3975(98)00313-2_BIB5","article-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","volume":"vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB6","first-page":"71","article-title":"Combinatorics in trace monoids I","author":"Choffrut","year":"1995"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB7","first-page":"329","article-title":"Combinatorics of words","volume":"vol. 1","author":"Choffrut","year":"1997"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB8","series-title":"Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP'97)","first-page":"336","article-title":"Solving trace equations using lexicographical normal forms","volume":"vol. 1256","author":"Diekert","year":"1997"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB9","year":"1995"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","article-title":"On some equations in free partially commutative monoids","volume":"46","author":"Duboc","year":"1986","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/S0304-3975(98)00313-2_BIB11_1","first-page":"717","article-title":"On equations in free semigroups and groups","volume":"16","author":"Durnev","year":"1974","journal-title":"Mat. Zametki"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB11_2","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1007\/BF01149791","volume":"16","author":"Durnev","year":"1975","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","article-title":"Logical definability on infinite traces","volume":"154","author":"Ebinger","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00313-2_BIB13","series-title":"Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP'97)","first-page":"98","article-title":"The expressibility of languages and relations by word equations","volume":"vol. 1256","author":"Karhum\u00e4ki","year":"1997"},{"issue":"3","key":"10.1016\/S0304-3975(98)00313-2_BIB14","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","article-title":"Parallel program schemata and maximal parallelism I. Fundamental results","volume":"20","author":"Keller","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00313-2_BIB15_1","first-page":"147","article-title":"The problem of solvability of equations in a free semigroup","volume":"103","author":"Makanin","year":"1977","journal-title":"Math. Sbornik"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB15_2","doi-asserted-by":"crossref","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"Makanin","year":"1977","journal-title":"Math. USSR Sbornik"},{"issue":"2","key":"10.1016\/S0304-3975(98)00313-2_BIB16_1","first-page":"279","article-title":"Enumerable sets are Diophantine","volume":"191","author":"Matiyasevich","year":"1970","journal-title":"Dok. Akad. Nauk SSSR"},{"issue":"2","key":"10.1016\/S0304-3975(98)00313-2_BIB16_2","volume":"11","author":"Matiyasevich","year":"1970","journal-title":"Soviet Mathematics. Doklady"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB17","series-title":"Hilbert's tenth problem, Foundations of Computing","author":"Matiyasevich","year":"1993"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB18","series-title":"Talk given at the \u201cColloquium on Computability, Complexity, and Logic\u201d","article-title":"Reduction of trace equations to word equations","author":"Matiyasevich","year":"1996"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB19","series-title":"Proc. 4th Internat. Symp. on Logical Foundations of Computer Science (LFCS'97)","first-page":"248","article-title":"Some decision problems for traces","volume":"vol. 1234","author":"Matiyasevich","year":"1997"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB20","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v6i78.7691","article-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB21","first-page":"679","article-title":"Syntactic semigroups","volume":"vol. 1","author":"Pin","year":"1997"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB22","series-title":"Word Equations and Related Topics","first-page":"85","article-title":"Makanin's algorithm for word equations \u2014 two improvements and a generalization","volume":"vol. 572","author":"Schulz","year":"1991"},{"key":"10.1016\/S0304-3975(98)00313-2_BIB23","series-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"Straubing","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:51:29Z","timestamp":1555375889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397598003132"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00313-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}