Non-uniform cellular automata and distributions of rules
Abstract
In this paper we study -CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced -CA has some properties. In a first part, we give some background for the study of -CA. Then surjectivity and injectivity are studied using a variant of DeBruijn graphs. The next part is dedicated to the number-conserving property.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.