367 search results - page 24 / 74 » Time-Symmetric Cellular Automata |
127
Voted
JAC
2008
15 years 3 months ago
2008
In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgam...
106
click to vote
TCS
2008
15 years 1 months ago
2008
A cellular automaton is a continuous function F defined on a full-shift AZ which commutes with the shift . Often, to study the dynamics of F one only considers implicitly . Howeve...
125
click to vote
COMPLEXITY
2010
14 years 11 months ago
2010
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
110
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
124
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...