When is a pair of matrices mortal?
Information Processing Letters
Example of undecidable problems for 2-generator matrix semigroups
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
Multiplicative equations over commuting matrices
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Widening the Boundary between Decidable and Undecidable Hybrid Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Computation in one-dimensional piecewise maps
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Computation in one-dimensional piecewise maps and planar pseudo-billiard systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Reachability problems in quaternion matrix and rotation semigroups
Information and Computation
The Identity Correspondence Problem and Its Applications
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Proceedings of the twenty-sixth annual symposium on Computational geometry
On the Computational Complexity of Matrix Semigroup Problems
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 5.24 |
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 5 two-dimensional affine transformations. Then, using a modified version of a standard technique, we also prove that the vector reachability problem is undecidable for two (rational) matrices in dimension 11. The above result can be used to show that the system of piecewise linear functions of dimension 12 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.