Abstract
In this paper we consider several reachability problems such as vector reachability, membership in matrix semigroups and reachability problems in piecewise linear maps. Since all of these questions are undecidable in general, we work on lowering the bounds for undecidability. In particular, we show an elementary proof of undecidability of the reachability problem for a set of 7 two-dimensional affine transformations. Then, using a modified version of a standard technique, we also prove the vector reachability problem is undecidable for two (rational) matrices in dimension 16. The above result can be used to show that the system of piecewise linear functions of dimension 17 with only two intervals has an undecidable set-to-point reachability problem. We also show that the “zero in the upper right corner” problem is undecidable for two integral matrices of dimension 18 lowering the bound from 23.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asarin, E., Schneider, G.: Widening the Boundary between Decidable and Undecidable Hybrid Systems. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 193–208. Springer, Heidelberg (2002)
Bestel, J., Karhumäki, J.: Combinatorics on Words - A Tutorial. Bulletin of the EATCS, pp. 178–228 (February 2003)
Blondel, V., Tsitsiklis, J.: When is a pair of matrices mortal? IPL 63, 283–286 (1997)
Cassaigne, J., Harju, T., Karhumäki, J.: On the decidability of the freeness of matrix semigroups. In the special issue of International Journal of Algebra and Computation 9, 295–305 (1999)
Cassaigne, J., Karhumäki, J.: Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science 204, 29–34 (1998)
Dube, S.: Undecidable problems in fractal geometry. Complex Systems 7(6), 423–444 (1993)
Gaubert, S., Katz, R.: Reachability problems for products of matrices in semirings (manuscript, 2003)
Halava, V., Harju, T., Hervensalo, M., Karhumäki, J.: Skolem’s Problem - On the Border Between Decidability and Undecidability, TUCS Technical Report (2005)
Halava, V., Harju, T.: Mortality in matrix semigroups, Amer. Math. Monthly (2001)
Koiran, P.: My favourite problems, http://www.ens-lyon.fr/~koiran/problems.html
Koiran, P., Moore, C.: Closed-form Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. Theor. Comput. Sci. 210(1), 217–223 (1999)
Kurganskyy, O., Potapov, I.: Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 169–175. Springer, Heidelberg (2005)
Matiyasevich, Y., Senizergues, G.: Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science 330(1), 145–169 (2005)
Paterson, M.S.: Unsolvability in 3 ×3 matrices. Studies in Appl. Math. 49, 105–107 (1970)
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–356. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bell, P., Potapov, I. (2006). Lowering Undecidability Bounds for Decision Questions in Matrices. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_34
Download citation
DOI: https://doi.org/10.1007/11779148_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)