Randomized Cellular Automata
arXiv:nlin/0702046 · doi:10.1142/S0129183107011339
Abstract
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.
13 pages, 7 figures