Sciweavers

1035 search results - page 20 / 207
» Communications in cellular automata
Sort
View
CG
2010
Springer
13 years 7 months ago
Medley of spirals from cyclic cellular automata
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
Clifford A. Reiter
TCS
2008
13 years 7 months ago
Directional dynamics for cellular automata: A sensitivity to initial condition approach
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...
Mathieu Sablik
MST
2010
79views more  MST 2010»
13 years 6 months ago
A Search Algorithm for Subshift Attractors of Cellular Automata
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...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...
COMPLEXITY
2010
108views more  COMPLEXITY 2010»
13 years 5 months ago
How to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
Genaro Juárez Martínez, Andrew Adama...
STACS
2009
Springer
14 years 2 months ago
Undecidable Properties of Limit Set Dynamics of Cellular Automata
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...
Pietro di Lena, Luciano Margara