A Fully Operational Framework for Handling Cellular Automata Templates
Cellular automata are fully discrete, computational, or dynamical systems, characterised by a local, totally decentralised action. Although extremely simple in structure, they are able to represent arbitrarily complex phenomena. However, due to the very big number of rules in any nontrivial space, f...
Saved in:
Main Authors: | Mauricio Verardo, Pedro P. B. de Oliveira |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/6573793 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Information-Based Classification of Elementary Cellular Automata
by: Enrico Borriello, et al.
Published: (2017-01-01) -
Colloidal Spin Ice Cellular Automata for Logic Design
by: Vasileios P. Karkanis, et al.
Published: (2024-01-01) -
Solutions to All-Colors Problem on Graph Cellular Automata
by: Xiaoyan Zhang, et al.
Published: (2019-01-01) -
Easy, fast and reproducible Stochastic Cellular Automata with chouca
by: Génin, Alexandre, et al.
Published: (2024-10-01) -
Nanosensor Data Processor in Quantum-Dot Cellular Automata
by: Fenghui Yao, et al.
Published: (2014-01-01)