Randomized Cellular Automata
元胞自动机与格子气
2009-11-13 v1
摘要
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.
引用
@article{arxiv.nlin/0702046,
title = {Randomized Cellular Automata},
author = {Nino Boccara},
journal= {arXiv preprint arXiv:nlin/0702046},
year = {2009}
}
备注
13 pages, 7 figures