2000 character limit reached
The freeness problem over matrix semigroups and bounded languages (1304.1637v1)
Published 5 Apr 2013 in cs.DM and math.CO
Abstract: We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular $2\times 2$ matrices with rational entries when the products are restricted to certain bounded languages.