Some decision problems on integer matrices

RAIRO - Theoretical Informatics and Applications

Volumn 39, Issue 1, 2005, Pages 125-131

  Choffrut, Christian ^a   Karhumäki, Juhani ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MATHEMATICAL OPERATORS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

FINITE NUMBERS; INTEGER MATRICES; NON SINGULAR MATRICES; SEMIGROUPS;

MATRIX ALGEBRA;

EID: 16244362666     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2005007     Document Type: Article

References (17)

1. J. Berstel, Transductions and context-free languages. B.G. Teubner (1979).
2. J. Cassaigne, T. Harju and J. Karhumäki, On the undecidability of freeness of matrix semigroups. Internat. J. Algebra Comput. 9 (1999) 295-305.
3. C. Choffrut, A remark on the representation of trace monoids. Semigroup Forum 40 (1990) 143-152.
4. M. Chrobak and W. Rytter, Unique decipherability for partially commutative alphabets. Fund. Inform. X (1987) 323-336.
5. S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press (1974).
6. T. Harju, Decision questions on integer matrices. Lect. Notes Comp. Sci. 2295 (2002) 57-68.
7. T. Harju and J. Karhumäki, Morphisms, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer-Verlag 1 (1997) 439-510.
8. G. Jacob, La finitude des représentations linéaires de semigroupes est décidable. J. Algebra 52 (1978) 437-459.
9. J. Karhumäki, Some opem problems in combinatorics of words and related areas, in Proc. of RIMS Symposium on Algebraic Systems, Formal Languages and Computation. RIMS Institute 1166 (2000) 118-130.
10. D.A. Klarner, J.-C. Birget and W. Satterfield, On the undecidability of the freeness of integer matrix semigroups monoids. Internat. J. Algebra Comput. 1 (1991) 223-226.
11. R. Lyndon and P. Schupp, Combinatorial Group Theory, of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag 89 (1977).
12. W. Magnus, The use of 2 by 2 matrices in combinatorial group theory. Resultate der Mathematik 4 (1981) 171-192.
13. A. Mandel and I. Simon, On finite semigroups of matrices. Theoret. Comput. Sci. 5 (1978) 101-112.
14. A.A. Markov, On certain insoluble problems concerning matrices (russian). Doklady Akad. Nauk SSSR (N.S.) 57 (1947) 539-542.
15. Open problems in group theory: http://zebra.sci.ccny.edu/cgi-bin/LINK. CGI?/www/web/problems/oproblems.html
16. M.S. Paterson, Unsolvability in 3 × trices. Stud. Appl. Math. 49 (1970) 105-107.
17. J.J. Rotman, An introduction to the Theory of Groups. Ally and Bacon Inc. (1965).