On Devaney's definition of chaos
American Mathematical Monthly
Dynamical behaviour of Coven's aperiodic cellular automata
Theoretical Computer Science
Investigating topological chaos by elementary cellular automata dynamics
Theoretical Computer Science
Chaotic subshifts and related languages applications to one-dimensional cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Number conserving cellular automata II: dynamics
Theoretical Computer Science
Solution of some conjectures about topological properties of linear cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Theoretical Computer Science
A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects
Fundamenta Informaticae
Computational complexity of dynamical systems: The case of cellular automata
Information and Computation
On the directional dynamics of additive cellular automata
Theoretical Computer Science
A search algorithm for the maximal attractor of a cellular automaton
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Sand automata as cellular automata
Theoretical Computer Science
On the directional dynamics of additive cellular automata
Theoretical Computer Science
On the undecidability of the limit behavior of Cellular Automata
Theoretical Computer Science
Some formal properties of asynchronous callular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Sand piles: From physics to cellular automata models
Theoretical Computer Science
Non-uniform cellular automata: Classes, dynamics, and decidability
Information and Computation
Asynchronous cellular automata and dynamical properties
Natural Computing: an international journal
On the Undecidability of Attractor Properties for Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
From One-dimensional to Two-dimensional Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof
Information Processing Letters
Local rule distributions, language complexity and non-uniform cellular automata
Theoretical Computer Science
Solving the parity problem in one-dimensional cellular automata
Natural Computing: an international journal
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Theoretical Computer Science
m-Asynchronous cellular automata: from fairness to quasi-fairness
Natural Computing: an international journal
Computing Issues of Asynchronous CA
Fundamenta Informaticae
Hi-index | 5.23 |
We consider the family of all the Cellular Automata (CA) sharing the same local rule but having different memories. This family contains also all CA with memory m@?0 (one-sided CA) which can act both on A^Z and on A^N. We study several set theoretical and topological properties for these classes. In particular, we investigate whether the properties of a given CA are preserved when considering the CA obtained by changing the memory of the original one (shifting operation). Furthermore, we focus our attention on the one-sided CA acting on A^Z, starting from the one-sided CA acting on A^N and having the same local rule (lifting operation). As a particular consequence of these investigations, we prove that the long-standing conjecture [Surjectivity @? Dense Periodic Orbits (DPO)] can be restated in several different (but equivalent) ways. Furthermore, we give some results on properties conserved under the iteration of the CA global map.