377 search results - page 19 / 76 » Quantization of cellular automata |
92
Voted
TCS
2008
15 years 9 days 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...
115
click to vote
MST
2010
14 years 10 months ago
2010
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
107
click to vote
COMPLEXITY
2010
14 years 9 months ago
2010
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
100
click to vote
STACS
2009
Springer
15 years 7 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...
116
click to vote
IPPS
2000
IEEE
15 years 4 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...