Number conserving cellular automata: form decidability to dynamics
元胞自动机与格子气
2007-05-23 v1
摘要
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to decide number-conservation. The dynamical behavior of number-conserving \cas is studied and a classification that focuses on chaoticity is given.
引用
@article{arxiv.nlin/0102035,
title = {Number conserving cellular automata: form decidability to dynamics},
author = {B. Durand and E. Formenti and Z. Roka},
journal= {arXiv preprint arXiv:nlin/0102035},
year = {2007}
}
备注
24 pages, 2 figures