Abstract
An extended class of Cellular Automata (CA), in which arbitrary transition functions are allowed, are considered as a model for spatial dynamic simulation, CA are represented as operators over a set of cellular arrays, where binary operations (superposition, addition and multiplication) are defined. The algebraic properties of the operations are studied. The aim of the investigation is to create a formal basis for the CA composition methods, which are also presented in brief. © Springer-Verlag 2004.
Cite
CITATION STYLE
Bandman, O. (2004). Algebraic properties of cellular automata: the basis for composition technique. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3305, 688–697. https://doi.org/10.1007/978-3-540-30479-1_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
