Boolean derivatives and computation of cellular automata
arXiv:cond-mat/9912353 · doi:10.1142/S0129183192000257
Abstract
The derivatives of a Boolean function are defined up to any order. The Taylor and MacLaurin expansions of a Boolean function are thus obtained. The last corresponds to the ring sum expansion (RSE) of a Boolean function, and is a more compact form than the usual canonical disjunctive form. For totalistic functions the RSE allows the saving of a large number of Boolean operations. The algorithm has natural applications to the simulations of cellular automata using the multi site coding technique. Several already published algorithms are analized, and expressions with fewer terms are generally found.
arXiv comment15 pages
Cited by in corpus (14)
- Lyapunov Exponents in Random Boolean Networks
- Synchronization and Maximum Lyapunov Exponents of Cellular Automata
- Nature of phase transitions in a probabilistic cellular automaton with two absorbing states
- On Damage Spreading Transitions
- Control of cellular automata
- Scaling behaviour in probabilistic neuronal cellular automata
- Thermodynamic Entropy and Chaos in a Discrete Hydrodynamical System
- Toward a Boundary Regional Control Problem for Boolean Cellular Automata
- Algorithmic Mapping Criticality into Self Organized Criticality
- Fast vectorized algorithm for the Monte Carlo Simulation of the Random Field Ising Model
- Phase Transitions of Cellular Automata
- Regional Control of Probabilistic Cellular Automata
- Effects of a Vanishing Noise on Elementary Cellular Automata Phase-Space Structure
- Site-bond representation and self-duality for totalistic probabilistic cellular automata