620 search results - page 8 / 124 » Algorithms and computations on cellular automata |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
PACT
2005
Springer
14 years 2 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
ALIFE
2005
13 years 8 months ago
2005
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...