Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
A new kind of science
A Course in Digital Signal Processing
A Course in Digital Signal Processing
Theory of cellular automata: a survey
Theoretical Computer Science
Introduction to Mathematical Logic
Introduction to Mathematical Logic
Computing with Probabilistic Cellular Automata
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Hi-index | 0.00 |
A novel algebraic and dynamic systems approach to finite elementary cellular automata is presented. In particular, simple algebraic expressions for the local rules of elementary cellular automata are deduced and the cellular automata configurations are represented via Fourier analysis. This allows for a further analysis of the global dynamics of cellular automata by the use of tools derived from functional analysis and dynamical system theory.