50 search results - page 2 / 10 » A Particular Universal Cellular Automaton |
JAC
2008
13 years 7 months ago
2008
We study a way of coupling two configurations of the same cellular automaton rule for all elementary cellular automata (ECA). We experimentally show that there are only two possibl...
EH
2004
IEEE
13 years 9 months ago
2004
IEEE
After a survey of some realizations of self-replicating machines, this paper presents the construction based selfreplication of universal 3D structures. This self-replication proc...
EUROGP
2003
Springer
13 years 10 months ago
2003
Springer
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 ...
LATIN
1995
Springer
13 years 9 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...