Remarks concerning the freeness problem over morphism and matrix semigroups




Juha Honkala

PublisherELSEVIER SCIENCE BV

2014

Theoretical Computer Science

THEORETICAL COMPUTER SCIENCE

THEOR COMPUT SCI

557

115

119

5

0304-3975

DOIhttps://doi.org/10.1016/j.tcs.2014.08.013



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 x 2 matrices having entries in R. (C) 2014 Elsevier B.V. All rights reserved.




Last updated on 2024-26-11 at 22:20