Multidimensional cellular automata and generalization of Fekete's lemma
classification
🧮 math.GM
math.DS
keywords
automatacellularfeketelemmaapplicationarbitrarilyautomatonboundary
read the original abstract
Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are characterized by loss of arbitrarily much information on finite supports, at a growth rate greater than that of the support's boundary determined by the automaton's neighbourhood index.
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.