When is a pair of matrices mortal?

Information Processing Letters

Volumn 63, Issue 5, 1997, Pages 283-286

  Blondel, Vincent D ^a   Tsitsiklis, John N ^b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Decidability; Matrix theory; Post's correspondence problem; Theory of computation

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

POST'S CORRESPONDENCE PROBLEM;

MATRIX ALGEBRA;

EID: 0031221062     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00123-3     Document Type: Article

References (10)

1. M. Branicky, Personal communication, May 1996.
2. J.E. Hopcroft and J.D. Ullman, Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, MA, 1969).
3. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman and Co., New York, 1979).
4. M. Krom and M. Krom, Recursive solvability of problems with matrices, Z. Math. Logik Grundlag. Math. 35 (1989) 437-442.
5. Y. Matiyasevich and G. Sénizergues, Decision problem for semi-Thue systems with a few rules, Preprint, 1996.
6. J.J. Pansiot, A note on Post's correspondence problem, Inform. Process. Lett. 12 (1981) 233.
7. C.H. Papadimitriou and J.N. Tsitsiklis, The complexity of Markov decision processes, Math. Oper. Res. 12 (1987) 441-450.
8. M.S. Paterson, Unsolvability in 3 x 3 matrices, Stud. Appl. Math. 49 (1970) 105-107.
9. O. Toker, On the algorithmic unsolvability of some stability problems for discrete event systems, in: Proc. IFAC World Congress (1996) 353-358.
10. J.N. Tsitsiklis and V.D. Blondel, Spectral quantities associated to pairs of matrices are hard - when not impossible - to compute and to approximate, Tech. Rept. LIDS-P-2325, Laboratory for Information and Decision Systems, M.I.T., Cambridge, MA, 1996; also in: Math. Control Signals Systems, to appear.