Undecidability of CA classification schemes
Complex Systems
Rice's theorem for the limit sets of cellular automata
Theoretical Computer Science
Pattern growth in elementary cellular automata
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Ergodicity of linear cellular automata over Zm
Information Processing Letters
Invertible linear cellular automata over Zm: algorithmic and dynamical aspects
Journal of Computer and System Sciences
Surjective linear cellular automata over Zm
Information Processing Letters
Theoretical Computer Science
Ergodicity, transitivity, and regularity for linear cellular automata over Zm1
Theoretical Computer Science
Attractors of linear cellular automata
Journal of Computer and System Sciences
Chaotic subshifts and related languages applications to one-dimensional cellular automata
Fundamenta Informaticae - Special issue on cellular automata
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
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
Conservation of some dynamical properties for operations on cellular automata
Theoretical Computer Science
Sand automata as cellular automata
Theoretical Computer Science
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Conservation of some dynamical properties for operations on 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
Directional dynamics along arbitrary curves in cellular automata
Theoretical Computer Science
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 continue the study of cellular automata (CA) directional dynamics, i.e. , the behavior of the joint action of CA and shift maps. This notion has been investigated for general CA in the case of expansive dynamics by Boyle and Lind; and by Sablik for sensitivity and equicontinuity. In this paper we give a detailed classification for the class of additive CA providing non-trivial examples for some classes of Sablik's classification. Moreover, we extend the directional dynamics studies by considering also factor languages and attractors.