The freeness problem over matrix semigroups and bounded languages
classification
💻 cs.DM
math.CO
keywords
freenessproblemboundedlanguagesmatrixsemigroupscertaindecidable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.