On Residually Finite Semigroups of Cellullar Automata
classification
🧮 math.GR
math.DS
keywords
automatafinitemonoidalphabetcellularcellullarconsistingelement
read the original abstract
We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.