Cellular automata in non-euclidean spaces

Authors:
Shuichi Yukita
Affiliations:
Faculty of Computer and Information Sciences, Hosei University, Koganei-shi, Tokyo, Japan
Venue:
MMACTE'05 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering
Year:
2005

Citing 4
Cited 0

Garden of Eden configurations for cellular automata on Cayley graphs of groups

SIAM Journal on Discrete Mathematics
Models of massive parallelism: analysis of cellular automata and neural networks

Models of massive parallelism: analysis of cellular automata and neural networks
Attractors of linear cellular automata

Journal of Computer and System Sciences
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classical results on the surjectivity and injectivity of parallel maps are shown to be extendible to the cases with non-Euclidean cell spaces of particular types. Also shown are obstructions to extendibility, which may shed light on the nature of classical results such as the Garden-of-Eden theorem.