{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T10:30:51Z","timestamp":1775644251303,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540630456","type":"print"},{"value":"9783540690658","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:59:50Z","timestamp":1330297190000},"page":"248-257","source":"Crossref","is-referenced-by-count":11,"title":["Some decision problems for traces"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Matiyasevich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"P. Cartier and D. Floata. Probl\u00e8me combinatoires de commutation et r\u00e9arrangements. Lecture Notes in Mathematics, 85, 1969.","DOI":"10.1007\/BFb0079468"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3233\/FI-1987-10305","volume":"X","author":"M. Chrobak","year":"1987","unstructured":"M. Chrobak and W. Rytter. Unique decipherability for partially commutative alphabets. Fundamenta Informaticae, X:323\u2013336, 1987.","journal-title":"Fundamenta Informaticae"},{"key":"25_CR3","volume-title":"The Book of Traces","year":"1995","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapoure a.o., 1995."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. Report 1997\/01, Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, 1997.","DOI":"10.1007\/3-540-63165-8_190"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0304-3975(96)00216-2","volume":"172","author":"H. J. Hoogeboom","year":"1997","unstructured":"Hendrik Jan Hoogeboom and Anca Muscholl. The code problem for traces-improving the boundaries. Theoretical Computer Science, 172:309\u2013321, 1997.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"25_CR6","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):129\u2013198, 1977.","journal-title":"Math. USSR Sbornik"},{"key":"25_CR7","first-page":"23","volume":"27","author":"Y. Matiiassevitch","year":"1997","unstructured":"Youri Matiiassevitch. Mots et codes: Cas d\u00e9cidables et ind\u00e9cidables du probl\u00e8me du codage pour les mono\u00cfdes partialement commutatifs. Quadrature, 27:23\u201333, 1997.","journal-title":"Quadrature"},{"key":"25_CR8","volume-title":"Desyataya Problema Gilberta","author":"Y. V. Matiyasevich","year":"1993","unstructured":"Yu. V. Matiyasevich. Desyataya Problema Gilberta. Nauka, Moscow, 1993. English translation: Hilbert's tenth problem. MIT Press, 1993. French translation: Le dixime probl\u00e8me de Hilbert. Masson, 1995."},{"key":"25_CR9","volume-title":"DAIMI Rep. PB 78","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarus University, Aaurus, 1977."},{"key":"25_CR10","first-page":"104","volume":"8","author":"A. Sardinas","year":"1953","unstructured":"A. Sardinas and C. Patterson. A necessary and sufficient condition for the unique decomposition of coded messages. IRE Intern. Conv. Record, 8:104\u2013108, 1953.","journal-title":"IRE Intern. Conv. Record"},{"key":"25_CR11","first-page":"85","volume-title":"volume 572 of Lecture Notes in Computer Science","author":"K. U. Schulz","year":"1992","unstructured":"Klaus U. Schulz. Makanin's algorithm for word equations-Two improvements and a generalization. In K. U. Schulz, editor, Word equations and related topics. 1st International Workshop, IWWERT'90, T\u00fcbingen, Germany, October 1990, volume 572 of Lecture Notes in Computer Science, pages 85\u2013150. Springer, 1992."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:29:12Z","timestamp":1640950152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}