{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:50:42Z","timestamp":1764557442074,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_38","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T23:43:57Z","timestamp":1533426237000},"page":"465-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reachability Problems in Nondeterministic Polynomial Maps on the Integers"],"prefix":"10.1007","author":[{"given":"Sang-Ki","family":"Ko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reino","family":"Niskanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"issue":"1\u20132","key":"38_CR1","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. Theor. Comput. Sci. 391(1\u20132), 3\u201313 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Duff, T., Sharad, A., Worrell, J.: Polynomial automata: Zeroness and applications. In: LICS, pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005101"},{"issue":"1\u20132","key":"38_CR3","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0304-3975(00)00399-6","volume":"255","author":"VD Blondel","year":"2001","unstructured":"Blondel, V.D., Bournez, O., Koiran, P., Papadimitriou, C.H., Tsitsiklis, J.N.: Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1\u20132), 687\u2013696 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"38_CR4","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S0005-1098(00)00050-9","volume":"36","author":"VD Blondel","year":"2000","unstructured":"Blondel, V.D., Tsitsiklis, J.N.: A survey of computational complexity results in systems and control. Automatica 36(9), 1249\u20131274 (2000)","journal-title":"Automatica"},{"key":"38_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4927-2","volume-title":"Iterated Maps on the Interval as Dynamical Systems","author":"P Collet","year":"2009","unstructured":"Collet, P., Eckmann, J.-P.: Iterated Maps on the Interval as Dynamical Systems. Birkhuser, Boston (2009)"},{"key":"38_CR6","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). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_37"},{"key":"38_CR7","volume-title":"Introduction to Chaos and Coherence","author":"J Fr\u00f8yland","year":"1992","unstructured":"Fr\u00f8yland, J.: Introduction to Chaos and Coherence. CRC Press, Boca Raton (1992)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-11439-2_9","volume-title":"Reachability Problems","author":"C Haase","year":"2014","unstructured":"Haase, C., Halfon, S.: Integer vector addition systems with states. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 112\u2013124. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9"},{"issue":"1\u20132","key":"38_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.3233\/FI-1999-381215","volume":"38","author":"V Halava","year":"1999","unstructured":"Halava, V., Harju, T.: Undecidability in integer weighted finite automata. Fundam. Inform. 38(1\u20132), 189\u2013200 (1999)","journal-title":"Fundam. Inform."},{"key":"38_CR10","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"key":"38_CR11","unstructured":"Neary, T.: Undecidability in binary tag systems and the Post correspondence problem for five pairs of words. In: STACS 2015. LIPIcs, vol. 30, pp. 649\u2013661 (2015)"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-67089-8_10","volume-title":"Reachability Problems","author":"R Niskanen","year":"2017","unstructured":"Niskanen, R.: Reachability problem for polynomial iteration is\u00a0PSPACE-complete. In: Hague, M., Potapov, I. (eds.) RP 2017. LNCS, vol. 10506, pp. 132\u2013143. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67089-8_10"},{"key":"38_CR13","unstructured":"Reichert, J.: Reachability Games with Counters: Decidability and Algorithms. Doctoral thesis, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (2015)"},{"key":"38_CR14","unstructured":"Skolem, T.: Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen. In: Skand. Mat. Kongr. Stockholm, vol. 8, pp. 163\u2013188 (1934)"},{"issue":"2","key":"38_CR15","first-page":"609","volume":"38","author":"NK Vereshchagin","year":"1985","unstructured":"Vereshchagin, N.K.: The problem of appearance of a zero in a linear recurrence sequence. Mat. Zametki 38(2), 609\u2013615 (1985)","journal-title":"Mat. Zametki"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T08:47:45Z","timestamp":1604738865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}