Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
This paper presents the implementation of an environment for the evolution of one-dimensional cellular automata using a reconfigurable logic device. This configware is aimed at eva...
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
This paper discusses a class of 2-dimensional asynchronous cellular automata with conservation of mass, for the formation of patterns in groups. The previous study reported a metho...
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...