Number conserving cellular automata: form decidability to dynamics

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
24 pages, 2 figures

Keywords

Cellular Automata and Lattice Gases

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/79962

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/nlin/0102035
 http://arxiv.org/abs/nlin/0102035

Collections

arXiv