Lowering undecidability bounds for decision questions in matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4036 LNCS, Issue , 2006, Pages 375-385

  Bell, Paul ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Matrix semigroups; Membership; Piecewise linear maps; Theory of computing; Vector reachability

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; VECTORS;

MATRIX SEMIGROUPS; MEMBERSHIP; PIECEWISE LINEAR MAPS; THEORY OF COMPUTING; VECTOR REACHABILITY;

PROBLEM SOLVING;

EID: 33746210759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779148_34     Document Type: Conference Paper

References (15)

1. E.Asarin, G.Schneider. Widening the Boundary between Decidable and Undecidable Hybrid Systems. CONCUR 2002: 193-208, 2002.
2. J.Bestel and J. Karhumäki. Combinatorics on Words - A Tutorial, Bulletin of the EATCS, 178-228, February 2003.
3. V.Blondel, J.Tsitsiklis, When is a pair of matrices mortal? IPL 63, 283-286, 1997.
4. J. Cassaigne, T. Harju and J. Karhumäki, On the decidability of the freeness of matrix semigroups. In the special issue of International Journal of Algebra and Computation, 9, 295-305, 1999.
5. J.Cassaigne, J.Karhumäki, Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science, 204, 29-34, 1998.
6. S.Dube. Undecidable problems in fractal geometry. Complex Systems 7, no. 6, 423-444, 1993.
7. S.Gaubert, R.Katz, Reachability problems for products of matrices in semirings, Manuscript, 2003.
8. V.Halava, T.Harju, M.Hervensalo, J.Karhumäki, Skolem's Problem - On the Border Between Decidability and Undecidability, TUCS Technical Report, 2005.
9. V.Halava, T.Harju, Mortality in matrix semigroups, Amer. Math. Monthly, 2001.
10. P. Koiran, My favourite problems, http://www.ens-lyon.fr/~koiran/ problems.html.
11. P.Koiran, C.Moore. Closed-form Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. Theor. Comput. Sci. 210(1), 217-223, 1999.
12. O.Kurganskyy, I.Potapov. Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. Unconventional Computation, LNCS 3699, 169-175, 2005.
13. Y.Matiyasevich, G.Senizergues. Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science, 330(1), 145-169, 2005.
14. M.S. Paterson. Unsolvability in 3 × 3 matrices, Studies in Appl. Math., v 49, 105-107, 1970.
15. I.Potapov. From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. Developments in Language Theory, LNCS 3340, 345-356, 2004.