Abstract
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2×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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have