The freeness problem over matrix semigroups and bounded languages
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.