{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:14:20Z","timestamp":1770282860450,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496299","type":"print"},{"value":"9783662496305","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_28","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"479-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Invariance Problem for Matrix Semigroups"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Dr\u00e4ger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0167-6911(00)00049-9","volume":"41","author":"VD Blondel","year":"2000","unstructured":"Blondel, V.D., Tsitsiklis, J.N.: The boundedness of all products of a pair of matrices is undecidable. Syst. Control Lett. 41(2), 135\u2013140 (2000)","journal-title":"Syst. Control Lett."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-40313-2_37","volume-title":"Mathematical Foundations of Computer Science 2013","author":"A Finkel","year":"2013","unstructured":"Finkel, A., G\u00f6ller, S., Haase, C.: Reachability in register machines with polynomial updates. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 409\u2013420. Springer, Heidelberg (2013)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Undecidability bounds for integer matrices using claus instances. Technical report 766 (2006)","DOI":"10.1142\/S0129054107005066"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1145\/6490.6496","volume":"33","author":"R Kannan","year":"1986","unstructured":"Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. J. ACM 33(4), 808\u2013821 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR7","unstructured":"Kurganskyy, O., Potapov, I.: Reachability problems for pams. CoRR, abs\/1510.04121 (2015)"},{"issue":"04","key":"28_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1142\/S0129054108006054","volume":"19","author":"O Kurganskyy","year":"2008","unstructured":"Kurganskyy, O., Potapov, I., Sancho-Caparrini, F.: Reachability problems in low-dimensional iterative maps. Int. J. Found. Comput. Sci. 19(04), 935\u2013951 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR9","unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.)Turing-100. The Alan Turing Centenary. EasyChair Proceedings in Computing, vol. 10, pp. 214\u2013228. EasyChair (2012)"},{"key":"28_CR10","volume-title":"Hilbert\u2019s Tenth Problem. With a foreword by Martin Davis","author":"Y Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. With a foreword by Martin Davis. MIT Press, Cambridge (1993)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 3340, pp. 345\u2013356. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T12:53:24Z","timestamp":1600347204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}