Article ID Journal Published Year Pages File Type
426756 Information and Computation 2014 14 Pages PDF
Abstract

We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2×22×2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for sufficiently large matrices.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The freeness problem over matrix semigroups and bounded languages
Authors
, ,