Dynamical behaviour of Coven's aperiodic cellular automata
Theoretical Computer Science
Investigating topological chaos by elementary cellular automata dynamics
Theoretical Computer Science
Decidable Properties of 2D Cellular Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Some formal properties of asynchronous callular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Asynchronous cellular automata and dynamical properties
Natural Computing: an international journal
Computing Issues of Asynchronous CA
Fundamenta Informaticae
Hi-index | 0.00 |
We consider the family of all the Cellular Automata (CA) sharingthe same local rule but have different memory. This family containsalso all the CA with memory m≤ 0 (one-sided CA) whichcan act both on Aℤand on Aℕ. We study several set theoretical andtopological properties for these classes. In particular weinvestigate if the properties of a given CA are preserved when weconsider the CA obtained by changing the memory of the original one(shifting operation). Furthermore we focus our attention to theone-sided CA acting on Aℕstarting fromthe one-sided CA acting on Aℤand havingthe same local rule (lifting operation). As a particularconsequence of these investigations, we prove that thelong-standing conjecture [Surjectivity $\Rightarrow$ Density of thePeriodic Orbits (DPO)] is equivalent to the conjecture [TopologicalMixing $\Rightarrow$ DPO].