On the membership of invertible diagonal matrices

Lecture Notes in Computer Science

Volumn 3572, Issue , 2005, Pages 146-157

  Bell, Paul ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; GEOMETRY; PROBLEM SOLVING;

DIAGONAL MATRICES; MATRIX SEMIGROUPS; POST CORRESPONDENCE PROBLEM (PCP);

MATRIX ALGEBRA;

EID: 26444601225     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11505877_13     Document Type: Conference Paper

References (11)

1. J.Bestel and J.Karhumäki. Combinatorics on Words - A Tutorial, Bulletin of the EATCS, February 2003, 178 - 228
2. V.Blondel, J.Cassaigne, J.Karhumäki. Problem 10.3. Freeness of multiplicative matrix semigroups. Unsolved Problems in Mathematical Systems and Control Theory, Edited by V.Blondel and A.Megretski, 309-314
3. V. Blondel and J. Tsitsiklis. A survey of computational complexity results in systems and control. Automatica, 36, 2000, 1249-1274
4. R.Graham, D.Knuth, O.Patashnik. Concrete Mathematics. 2nd edition, Addison-Wesley, 1994
5. V.Halava, T.Harju. Mortality in Matrix Semigroups, American Mathematical Monthly, Vol 108 No. 7, (2001) 649-653
6. R.Kannan and R.Lipton. Polynomial-time algorithm for the orbit problem, Journal of the ACM (JACM), Volume 33, Issue 4, 1986, 808 - 821
7. A.Lisitsa, I.Potapov. Membership and reachability problems for row-monomial transformations. MFCS, 2004, 623-634
8. C.Moore. Unpredictability and Undecidability in Dynamical Systems, Physical Review Letters, Vol.64, N. 20, 1990, 2354-2357
9. M.Paterson. Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics, 49 (1970), 105-107
10. I.Potapov. From Post systems to the reachability problems for matrix semigroups and counter automata. 8th International Conference on Developments in Language Theory (DLT04), LNCS 3340, 345-356
11. http://planetmath.org/encyclopedia/FreeGroup.html