Abstract
The stable patterns formed as a result of evolution of totalistic cellular automata (CA) with weighed templates are investigated. A formal definition of the CA with the weighed templates is presented. As a result of simulation by synchronous and asynchronous CA, various stable patterns emerging from one nucleation cell are obtained and classified. The influence of weight matrix entries on stable patterns is studied. The theorem about the stable patterns dependence on the ratio of positive to negative entries of a weight matrix is proved. Stable patterns formed of two nucleation cells are also investigated. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Sharifulina, A. (2012). Investigation of stable patterns formed by totalistic cellular automata evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 161–170). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
