On algebraic cellular automata
classification
🧮 math.AG
math.DSmath.GR
keywords
automatacellularalgebraicclosedtheyaffinealgebraicallyalphabets
read the original abstract
We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When the ground field is assumed to be uncountable and algebraically closed, we prove that such cellular automata always have a closed image with respect to the prodiscrete topology on the space of configurations and that they are reversible as soon as they are bijective.
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.