Multi-site coding techniques allow fast simulations of cellular automata that are economical in the use of memory. In these techniques the transition rule must be expressed using only bitwise operations. We present an algorithm for the simulation of generic totalistic and outer totalistic cellular automata which uses a multi-site coding technique. The algorithm is based on the careful use of (a) improvements over the canonical forms by using the exclusive-or operation, (b) optimal storage of the configuration in the computer memory, and (c) appropriate construction of stochastic rules. Items (b) and (c) of the method can be also applied to non-totalistic automata in any dimension.
General algorithm for two-dimensional totalistic cellular automata / Franco Bagnoli;Raúl Rechtman;Stefano Ruffo. - In: JOURNAL OF COMPUTATIONAL PHYSICS. - ISSN 0021-9991. - STAMPA. - 101:(1992), pp. 176-184. [10.1016/0021-9991(92)90051-Y]
General algorithm for two-dimensional totalistic cellular automata
BAGNOLI, FRANCO;RUFFO, STEFANO
1992
Abstract
Multi-site coding techniques allow fast simulations of cellular automata that are economical in the use of memory. In these techniques the transition rule must be expressed using only bitwise operations. We present an algorithm for the simulation of generic totalistic and outer totalistic cellular automata which uses a multi-site coding technique. The algorithm is based on the careful use of (a) improvements over the canonical forms by using the exclusive-or operation, (b) optimal storage of the configuration in the computer memory, and (c) appropriate construction of stochastic rules. Items (b) and (c) of the method can be also applied to non-totalistic automata in any dimension.File | Dimensione | Formato | |
---|---|---|---|
BagnoliRechtmanRuffo-GeneralAlgorithm2DCA-JCompPhys101-176.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
840.03 kB
Formato
Adobe PDF
|
840.03 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.