Number conserving cellular automata: form decidability to dynamics

Simple item page
dc.creatorDurand, B.
dc.creatorFormenti, E.
dc.creatorRoka, Z.
dc.date2001-02-27
dc.date.accessioned2026-07-07T05:33:20Z
dc.date.available2026-07-07T05:33:20Z
dc.descriptionWe 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.
dc.description24 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/nlin/0102035
dc.identifierhttp://arxiv.org/abs/nlin/0102035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79962
dc.subjectCellular Automata and Lattice Gases
dc.titleNumber conserving cellular automata: form decidability to dynamics
dc.typetext

Files

Collections

arXiv