The freeness problem over matrix semigroups and bounded languages
Discrete Mathematics
2013-04-08 v1 Combinatorics
Abstract
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular matrices with rational entries when the products are restricted to certain bounded languages.
Keywords
Cite
@article{arxiv.1304.1637,
title = {The freeness problem over matrix semigroups and bounded languages},
author = {Émilie Charlier and Juha Honkala},
journal= {arXiv preprint arXiv:1304.1637},
year = {2013}
}
Comments
17 pages