Enumeration of number-conserving cellular automata rules with two inputs

Simple item page
dc.creatorFuks, Henryk
dc.creatorSullivan, Kate
dc.date2007-11-08
dc.date.accessioned2026-07-07T08:41:39Z
dc.date.available2026-07-07T08:41:39Z
dc.descriptionWe show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show that number-conserving rules are becoming increasingly rare as the number of states increases.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0711.1349
dc.identifierhttp://arxiv.org/abs/0711.1349
dc.identifierJournal of Cellular Automata 2 vol. 2 pp. 141-148 (2007)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141739
dc.subjectCellular Automata and Lattice Gases
dc.titleEnumeration of number-conserving cellular automata rules with two inputs
dc.typetext

Files

Collections

arXiv