Robert Fokkink, Reem Yassawi
Published 2018-01-09Version 1
We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular automaton shift is a finitely generated abelian group.
Comments: 10 pages, 1 figure
Automorphism groups of random substitution subshifts
Endomorphisms and automorphisms of minimal symbolic systems with sublinear complexity
On the automorphism group of minimal S-adic subshifts of finite alphabet rank
![QR code for arXiv:1801.02835 [math.DS]](http://oss.arxitics.com/images/favicon.svg)