On the Undecidability of Freeness of Matrix Semigroups
暂无分享,去创建一个
We slightly improve the result of Klarner, Birget and Satterfield, showing that the freeness of finitely presented multiplicative semigroups of 3×3 matrices over ℕ is undecidable even for triangular matrices. This is achieved by proving a new variant of Post correspondence problem. We also consider the freeness problem for 2×2 matrices. On the one hand, we show that it cannot be proved undecidable using the above methods which work in higher dimensions, and, on the other hand, we give some evidence that its decidability, if so, is also a challenging problem.
[1] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[2] Jean-Camille Birget,et al. On the Undecidability of the Freeness of Integer Matrix Semigroups , 1991, Int. J. Algebra Comput..
[3] Tero Harju,et al. A Note on Decidability Questions on Presentations of Word Semigroups , 1997, Theor. Comput. Sci..
[4] J. Berstel,et al. Theory of codes , 1985 .