The complexity of Boolean functions
The complexity of Boolean functions
Boolean derivatives on cellular automata
Physica D
A new kind of science
Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
Information Sciences: an International Journal
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Hi-index | 0.09 |
Global dynamics of a non-linear Cellular Automaton (CA), is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In this paper, efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian matrices. A few new theorems on Hamming Distance between Boolean functions as well as on Jacobian matrices of cellular automata are proposed and proved. Moreover, a classification of Boolean functions based on the nature of deviation from linearity has been suggested with a view to grouping them together to classes/subclasses such that the members of a class/subclass satisfy certain similar properties. Next, an error vector, which cannot be captured by the Jacobian matrix, is identified and systematically classified. This leads us to the concept of modified Jacobian matrix whereby a quasi-affine representation of a non-linear cellular automaton is introduced.