Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
Theoretical Computer Science
On Some Topological Properties of Linear Cellular Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On computing the entropy of cellular automata
Theoretical Computer Science
Solution of some conjectures about topological properties of linear cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Theory of cellular automata: a survey
Theoretical Computer Science
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects
Fundamenta Informaticae
Topological Dynamics of 2D Cellular Automata
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Decidable Properties of 2D Cellular Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Conservation of some dynamical properties for operations on cellular automata
Theoretical Computer Science
Sand automata as cellular automata
Theoretical Computer Science
On the directional dynamics of additive cellular automata
Theoretical Computer Science
A full cellular automaton to simulate predator-prey systems
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Non-uniform cellular automata: Classes, dynamics, and decidability
Information and Computation
Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata
Fundamenta Informaticae - Cellular Automata
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
m-Asynchronous cellular automata: from fairness to quasi-fairness
Natural Computing: an international journal
Hi-index | 5.23 |
In this paper we study the dynamics of D-dimensional cellular automata (CA) by considering them as one-dimensional (1D) CA along some direction (slicing constructions). These constructions allow to give the D-dimensional version of important notions as 1D closing property and lift well-known one-dimensional results to the D-dimensional settings. Indeed, like in one-dimensional case, closing D-dimensional CA have jointly dense periodic orbits and biclosing D-dimensional CA are open. By the slicing constructions, we further prove that for the class of closing D-dimensional CA, surjectivity implies surjectivity on spatially periodic configurations (old standing open problem). We also deal with the decidability problem of the D-dimensional closing. By extending the Kari@?s construction from [31] based on tilings, we prove that the two-dimensional, and then D-dimensional, closing property is undecidable. In such a way, we add one further item to the class of dimension sensitive properties, i.e., properties that are decidable in dimension 1 and are undecidable in higher dimensions. It is well-known that there are not positively expansive CA in dimension 2 and higher. As a meaningful replacement, we introduce the notion of quasi-expansivity for D-dimensional CA which shares many global properties (in the D-dimensional settings) with the 1D positive expansivity. We also prove that for quasi-expansive D-dimensional CA the topological entropy (which is an uncomputable property for general CA) has infinite value. In a similar way as quasi-expansivity, the notions of quasi-sensitivity and quasi-almost equicontinuity are introduced and studied.