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×2 matrices having entries in R.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
