{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:46:27Z","timestamp":1764557187804},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77566-9_13","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T01:18:43Z","timestamp":1199495923000},"page":"148-161","source":"Crossref","is-referenced-by-count":5,"title":["Periodic and Infinite Traces in Matrix Semigroups"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput.\u00a0130(1), 71\u201390 (1996)","journal-title":"Inf. Comput."},{"key":"13_CR2","unstructured":"Babai, L., Beals, R., Cai, J., Ivanyos, G., Luks, E.M.: Multiplicative Equations Over Commuting Matrices. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 28\u201330 (1996)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11779148_34","volume-title":"Developments in Language Theory","author":"P. Bell","year":"2006","unstructured":"Bell, P., Potapov, I.: Lowering Undecidability Bounds for Decision Questions in Matrices. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 375\u2013385. Springer, Heidelberg (2006)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"MFCS 2007","author":"P. Bell","year":"2007","unstructured":"Bell, P., Potapov, I.: Reachability Problems in Quaternion Matrix and Rotation Semigroups. In: Kucera, L., Kucera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00224-003-1061-2","volume":"36","author":"V. Blondel","year":"2003","unstructured":"Blondel, V., Canterini, V.: Undecidable Problems for Probabilistic Automata of Fixed Dimensions. Theory Comput. Syst.\u00a036(3), 231\u2013245 (2003)","journal-title":"Theory Comput. Syst."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Blondel, V., Cassaigne, J., Karhum\u00e4ki, J.: Problem 10.3. In: Blondel, V., Megretski, A. (eds.) Freeness of Multiplicative Matrix Semigroups, Unsolved Problems in Mathematical Systems and Control Theory, pp. 309\u2013314","DOI":"10.1515\/9781400826155.309"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0304-3975(01)00382-6","volume":"289","author":"V. Blondel","year":"2002","unstructured":"Blondel, V., Cassaigne, J., Nichitiu, C.: On the Presence of Periodic Configurations in Turing Machines and in Counter Machines. Theoretical Computer Science\u00a0289, 573\u2013590 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Undecidability Bounds for Integer Matrices using Claus Instances, TUCS Technical Report No. 766 (2006)","DOI":"10.1142\/S0129054107005066"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1051\/ita:2006039","volume":"40","author":"V. Halava","year":"2006","unstructured":"Halava, V., Harju, T.: Undecidability of Infinite Post Correspondence Problem for Instances of Size 9. Theoretical Informatics and Applications\u00a040, 551\u2013557 (2006)","journal-title":"Theoretical Informatics and Applications"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","volume":"168","author":"I. Korec","year":"1996","unstructured":"Korec, I.: Small Universal Register Machines. Theoretical Computer Science\u00a0168, 267\u2013301 (1996)","journal-title":"Theoretical Computer Science"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kurganskyy, O., Potapov, I.: Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. Unconventional Computation, 169\u2013175 (2005)","DOI":"10.1007\/11560319_16"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Lisitsa, A., Potapov, I.: In Time Alone: On the Computational Power of Querying the History. In: TIME 2006, pp. 42\u201349 (2006)","DOI":"10.1109\/TIME.2006.18"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2004.09.016","volume":"330","author":"Y. Matiyasevic","year":"2005","unstructured":"Matiyasevic, Y., S\u00e9nizergues, G.: Decision Problems for Semi-Thue Systems with a Few Rules. Theoretical Computer Science\u00a0330, 145\u2013169 (2005)","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive Unsolvability of Post\u2019s Problem of \u201ctag\u201d and other Topics in Theory of Turing Machines. Annals of Mathematics\u00a074, 437\u2013455 (1961)","journal-title":"Annals of Mathematics"},{"key":"13_CR15","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall International, Englewood Cliffs (1967)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-30550-7_29","volume-title":"Developments in Language Theory","author":"I. Potapov","year":"2004","unstructured":"Potapov, I.: From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 345\u2013356. Springer, Heidelberg (2004)"},{"key":"13_CR17","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing (1997)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T13:46:53Z","timestamp":1684158413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775652","9783540775669"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_13","relation":{},"subject":[]}}