The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinge...
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...