{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:51:35Z","timestamp":1794369095253,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_67","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"657-667","source":"Crossref","is-referenced-by-count":0,"title":["The Identity Correspondence Problem and Its Applications"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Bell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"67_CR1","unstructured":"Babai, L., Beals, R., Cai, J., Ivanyos, G., Luks, E.M.: Multiplicative Equations over Commuting Matrices. In: 7th ACM-SIAM Symp. on Discrete Algorithms, pp. 498\u2013507 (1996)"},{"issue":"1","key":"67_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2006.11.011","volume":"372","author":"P. Bell","year":"2007","unstructured":"Bell, P., Potapov, I.: On the Membership of Invertible Diagonal and Scalar Matrices. Theoretical Computer Science\u00a0372(1), 37\u201345 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"67_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2007.10.025","volume":"391","author":"P. Bell","year":"2008","unstructured":"Bell, P., Potapov, I.: On Undecidability Bounds for Matrix Decision Problems. Theoretical Computer Science\u00a0391(1-2), 3\u201313 (2008)","journal-title":"Theoretical Computer Science"},{"key":"67_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-77566-9_13","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"P. Bell","year":"2008","unstructured":"Bell, P., Potapov, I.: Periodic and Infinite Traces in Matrix Semigroups. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 148\u2013161. Springer, Heidelberg (2008)"},{"issue":"11","key":"67_CR5","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.ic.2008.06.004","volume":"206","author":"P. Bell","year":"2008","unstructured":"Bell, P., Potapov, I.: Reachability Problems in Quaternion Matrix and Rotation Semigroups. Information and Computation\u00a0206(11), 1353\u20131361 (2008)","journal-title":"Information and Computation"},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1515\/9781400826155","volume-title":"Unsolved Problems in Mathematical Systems and Control Theory","author":"V.D. Blondel","year":"2004","unstructured":"Blondel, V.D., Cassaigne, J., Karhum\u00e4ki, J.: Problem 10.3, Freeness of Multiplicative Matrix Semigroups. In: Blondel, V.D., Megretski, A. (eds.) Unsolved Problems in Mathematical Systems and Control Theory, pp. 309\u2013314. Princeton University Press, Princeton (2004)"},{"issue":"2","key":"67_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0167-6911(00)00049-9","volume":"41","author":"V.D. Blondel","year":"2000","unstructured":"Blondel, V.D., Tsitsiklis, J.: The Boundedness of All Products of a Pair of Matrices is Undecidable. Systems and Control Letters\u00a041(2), 135\u2013140 (2000)","journal-title":"Systems and Control Letters"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1142\/S0218196799000199","volume":"9","author":"J. Cassaigne","year":"1999","unstructured":"Cassaigne, J., Harju, T., Karhum\u00e4ki, J.: On the Undecidability of Freeness of Matrix Semigroups. Intern. J. Alg. & Comp.\u00a09, 295\u2013305 (1999)","journal-title":"Intern. J. Alg. & Comp."},{"key":"67_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita:2005007","volume":"39","author":"C. Choffrut","year":"2005","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Some Decision Problems on Integer Matrices. Theoretical Informatics and Applications\u00a039, 125\u2013131 (2005)","journal-title":"Theoretical Informatics and Applications"},{"key":"67_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Allesandro, F.: Free Groups of Quaternions. IJAC\u00a014(1) (2004)","DOI":"10.1142\/S0218196704001669"},{"key":"67_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-02737-6_3","volume-title":"Post Correspondence Problem and Small Dimensional Matrices","author":"T. Harju","year":"2009","unstructured":"Harju, T.: Post Correspondence Problem and Small Dimensional Matrices. LNCS, vol.\u00a05583, pp. 39\u201346. Springer, Berlin (2009)"},{"key":"67_CR12","unstructured":"Halava, V., Harju, T.: On Markov\u2019s Undecidability Theorem for Integer Matrices, TUCS Technical Report, Number 758 (2006)"},{"issue":"5","key":"67_CR13","first-page":"931","volume":"18","author":"V. Halava","year":"2007","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Undecidability Bounds for Integer Matrices using Claus Instances. IJFCS\u00a018(5), 931\u2013948 (2007)","journal-title":"IJFCS"},{"key":"67_CR14","volume-title":"Combinatorial Group Theory","author":"R.C. Lyndon","year":"1977","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Heidelberg (1977)"},{"issue":"1","key":"67_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2004.09.016","volume":"330","author":"Y. Matiyasevich","year":"2005","unstructured":"Matiyasevich, Y., Senizergues, G.: Decision Problems for Semi-Thue Systems with a Few Rules. Theoretical Computer Science\u00a0330(1), 145\u2013169 (2005)","journal-title":"Theoretical Computer Science"},{"key":"67_CR16","first-page":"1103","volume":"119","author":"K.A. Mihailova","year":"1958","unstructured":"Mihailova, K.A.: The Occurrence Problem for a Direct Product of Groups. Dokl. Akad. Nauk\u00a0119, 1103\u20131105 (1958) (in Russian)","journal-title":"Dokl. Akad. Nauk"},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00268077","volume":"23","author":"F. Otto","year":"1986","unstructured":"Otto, F.: On Deciding whether a Monoid is a Free Monoid or a Group. Acta Informatica\u00a023, 99\u2013110 (1986)","journal-title":"Acta Informatica"},{"key":"67_CR18","doi-asserted-by":"crossref","unstructured":"Paterson, M.: Unsolvability in 3 \u00d7 3 Matrices. Studies in Applied Mathematics\u00a049 (1970)","DOI":"10.1002\/sapm1970491105"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T06:55:12Z","timestamp":1634280912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_67","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}