Non-uniform cellular automata and distributions of rules
Formal Languages and Automata Theory
2011-08-09 v1 Cellular Automata and Lattice Gases
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.
Keywords
Cite
@article{arxiv.1108.1419,
title = {Non-uniform cellular automata and distributions of rules},
author = {Julien Provillard and Enrico Formenti and Alberto Dennunzio},
journal= {arXiv preprint arXiv:1108.1419},
year = {2011}
}