The mortality problem for matrices of low dimensions

Theory of Computing Systems

Volumn 35, Issue 4, 2002, Pages 433-448

  Bournez, O ^a   Branicky, M ^b  

^a LORIA   (France)

^b Case Western Reserve University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MORTALITY PROBLEMS;

ALGORITHMS; DECISION THEORY; PROBLEM SOLVING; SET THEORY;

MATRIX ALGEBRA;

EID: 0036629054     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1010-5     Document Type: Conference Paper

References (27)

1. E. Asarin, O. Maler, and A. Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138(l):35-65, February 1995.
2. V. D. Blondel and J. N. Tsitsiklis. When is a pair of matrices mortal? Information Processing Letters, 63(5):283-286, September 1997.
3. V. D. Blondel and J. N. Tsitsiklis. Complexity of stability and controllability of elementary hybrid systems. Automatica, 35(3):473-489, 1999.
4. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, New York, 1998.
5. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1-46, July 1989.
6. J. Cassaigne and J. Karhumäki. Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science, 204(l):29-34, September 1998.
7. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, CA, 1979.
8. T. Harju and J. Karhumaki. Morphisms. In G. Rozenberg and A. Salomaa, eds., Handbook of Formal Languages, Volume 1, pp. 439-510. Springer-Verlag, Berlin, 1997.
9. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57(1):94-124, August 1998.
10. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
11. D. A. Klarner, J. C. Birget, and W. Satterfield. On the undecidability of the freeness of integer matrix semigroups. International Journal of Algebra and Computation, 1:223-226, 1991.
12. P. Koiran, M. Cosnard, and M. Garzon. Computability with low-dimensional dynamical systems. Theoretical Computer Science, 132(1-2):113-128, September 1994.
13. V. S. Kozyakin. Algebraic unsolvability of problems of absolute stability of desynchronized systems. Scientific-Industrial Organization of Automatic Control Systems, 6:41-47, 1990.
14. M. Krom. An unsolvable problem with products of matrices. Mathematical System Theory, 14:335-337, 1981.
15. M. Krom and M. Krom. Recursive solvability of problems with matrices. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35:437-442, 1989.
16. M. Krom and M. Krom. More on mortality. American Mathematical Monthly, 97:37-38, 1990.
17. Z. Manna. Mathematical Theory of Computation. MCGraw-Hill, New York, 1974.
18. Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 523-531. IEEE Computer Society Press, New York, 1996. An extended version can be found on the web page http://dept-info.labri.u-bordeaux.fr/̃ges/publis_rewriting.html.
19. C. Moore. Unpredictability and undecidability in dynamical systems. Physical Review Letters, 64(20):2354-2357, May 1990.
20. M. S. Paterson. Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics, XLIX(1):105-107, March 1970.
21. Y. Saouter. The mortality of a pair of 2 × 2 matrices is decidable. Technical Report RR-2842, Institut National de Recherche en Informatique et en Automatique, 1996.
22. P. Schultz. Mortality of 2 × 2 matrices. American Mathematical Monthly, 84(2):463-464, 1977. Correction, 85:263, 1978.
23. P. Schultz. Mortality of 2 × 2 matrices. American Mathematical Monthly, 84(2):463-464, 1977. Correction, 85:263, 1978.
24. H. S. Shank. The rational case of a matrix problem of Harrison. Discrete Mathematics, 28:207-212, 1979.
25. H. T. Siegelmann and E. D. Sontag. On the computational power of neural nets. Journal of Computer and System Sciences, 50(1): 132-150, February 1995.
26. N. Vereshchagin. Occurrence of zero in a linear recursive sequence. Mathematical Notes, 38:609-615, 1985. Translation from Matematicheskie Zametki 38(2);609-615, 1985
27. K. Weihrauch. A simple introduction to computable analysis. Technical Report 171-2/1995, Fernuniversität Gesamthochschule in Hagen, Fachbereich Informatik, Hagen, 1995.