{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:19:53Z","timestamp":1743088793517,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031726200"},{"type":"electronic","value":"9783031726217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-72621-7_12","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:02:34Z","timestamp":1726729354000},"page":"167-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability in\u00a0Linear Recurrence Automata"],"prefix":"10.1007","author":[{"given":"Mika","family":"Hirvensalo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akitoshi","family":"Kawamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Yuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,18]]},"reference":[{"issue":"8","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1142\/S0218196708004925","volume":"18","author":"P Bell","year":"2008","unstructured":"Bell, P., Halava, V., Harju, T., Karhum\u00e4ki, J., Potapov, I.: Matrix equations and Hilbert\u2019s tenth problem. Int. J. Algebra Comput. 18(8), 1231\u20131241 (2008)","journal-title":"Int. J. Algebra Comput."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bell, P., Potapov, I.: On undecidability bounds for matrix decision problems. Theor. Comput. Sci. 391(1), 3\u201313 (2008). Combinatorics, Automata and Number Theory","DOI":"10.1016\/j.tcs.2007.10.025"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104736","volume":"281","author":"PC Bell","year":"2021","unstructured":"Bell, P.C., Potapov, I., Semukhin, P.: On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281, 104736 (2021)","journal-title":"Inf. Comput."},{"key":"12_CR4","unstructured":"Bilu, Y., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., Worrell, J.: Skolem meets Schanuel. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 241, pp. 20:1\u201320:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Portier, N.: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear Algebra Appl. 351\u2013352, 91\u201398 (2002). Fourth Special Issue on Linear Systems and Control","DOI":"10.1016\/S0024-3795(01)00466-9"},{"key":"12_CR6","unstructured":"Caswell, H.: Matrix Population Models, 2nd edn. Sinauer (2001)"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.2307\/1937455","volume":"75","author":"H Caswell","year":"1994","unstructured":"Caswell, H., Trevisan, M.C.: Sensitivity analysis of periodic matrix models. Ecology 75(5), 1299\u20131303 (1994)","journal-title":"Ecology"},{"issue":"05","key":"12_CR8","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1142\/S0129054107005066","volume":"18","author":"V Halava","year":"2007","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Undecidability bounds for integer matrices using Claus instances. Int. J. Found. Comput. Sci. 18(05), 931\u2013948 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-007-0047-y","volume":"44","author":"V Halava","year":"2007","unstructured":"Halava, V., Hirvensalo, M.: Improved matrix pair undecidability results. Acta Informatica 44(3), 191\u2013205 (2007)","journal-title":"Acta Informatica"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Hirvensalo, M., Yakaryilmaz, A.: Decision problems on unary probabilistic and quantum automata. Balt. J. Mod. Comput. 4(4) (2016)","DOI":"10.22364\/bjmc.2016.4.4.22"},{"key":"12_CR11","unstructured":"Hitarth, S., Kenison, G., Kov\u00e1cs, L., Varonka, A.: Linear loop synthesis for quadratic invariants. In: Beyersdorff, O., Kant\u00e9, M.M., Kupferman, O., Lokshtanov, D. (eds.) 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 289, pp. 41:1\u201341:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"12_CR12","unstructured":"Jaax, S., Kiefer, S.: On affine reachability problems. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). LIPIcs, vol. 170, pp. 48:1\u201348:14 (2020)"},{"key":"12_CR13","unstructured":"Kenison, G.: On the Skolem problem for reversible sequences. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 241, pp. 61:1\u201361:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104785","volume":"281","author":"S Ko","year":"2021","unstructured":"Ko, S., Niskanen, R., Potapov, I.: Reachability problems in low-dimensional nondeterministic polynomial maps over integers. Inf. Comput. 281, 104785 (2021)","journal-title":"Inf. Comput."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lipton, R., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., Worrell, J.: On the Skolem problem and the Skolem conjecture. In: Baier, C., Fisman, D. (eds.) LICS 2022: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2\u20135 August 2022, pp. 5:1\u20135:9. ACM (2022)","DOI":"10.1145\/3531130.3533328"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-540-28629-5_48","volume-title":"Mathematical Foundations of Computer Science 2004","author":"A Lisitsa","year":"2004","unstructured":"Lisitsa, A., Potapov, I.: Membership and reachability problems for row-monomial transformations. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 623\u2013634. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28629-5_48"},{"key":"12_CR17","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). https:\/\/doi.org\/10.1007\/978-3-540-30550-7_29"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/inco.1994.1076","volume":"113","author":"J Shallit","year":"1994","unstructured":"Shallit, J.: Numeration systems, linear recurrences, and regular sets. Inf. Comput. 113(2), 331\u2013347 (1994)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72621-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:06:50Z","timestamp":1726729610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72621-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031726200","9783031726217"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72621-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/RP24\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}