Answers are grounded in this paper and cite their sources.
The paper characterises cellular automata (CA) with the help of matrix algebra. It has been shown how k-neighborhood additive CA rules (uniform, complemented and hybrid) can be represented with the help of a characteristic matrix representing the CA. Further, the paper discusses how the global group properties of the automata depend on the hybridisation of rules, the length of the automata, the starting state, etc.
No takes yet. Share an insight, caveat, or question.
Das et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: