Article ID Journal Published Year Pages File Type
436302 Theoretical Computer Science 2014 5 Pages PDF
Abstract

We study the freeness problem over morphism and matrix semigroups. We show that the freeness problem is undecidable for morphisms over a three-letter alphabet. We show that there is a commutative semiring R   such that the freeness problem is undecidable for upper-triangular 2×22×2 matrices having entries in R.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Remarks concerning the freeness problem over morphism and matrix semigroups
Authors
,