Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Solution of some conjectures about topological properties of linear cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Delay-insensitive computation in asynchronous cellular automata
Journal of Computer and System Sciences
Some results about the chaotic behavior of cellular automata
Theoretical Computer Science
Fully asynchronous behavior of double-quiescent elementary cellular automata
Theoretical Computer Science
A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects
Fundamenta Informaticae
Decidable Properties of 2D Cellular Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
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
Sand automata as cellular automata
Theoretical Computer Science
On the directional dynamics of additive cellular automata
Theoretical Computer Science
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority
Theoretical Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
A full cellular automaton to simulate predator-prey systems
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Asynchronous behavior of double-quiescent elementary cellular automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Non-uniform cellular automata: Classes, dynamics, and decidability
Information and Computation
Asynchronous cellular automata and dynamical properties
Natural Computing: an international journal
Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata
Fundamenta Informaticae - Cellular Automata
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
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Theoretical Computer Science
Natural Computing: an international journal
Hi-index | 0.00 |
A new model for the study of asynchronous cellular automata dynamical behavior is introduced with the main purpose of unifying several existing paradigms. The main idea is to measure the set of updating sequences to quantify the dependency of the properties under investigation from them. We propose to use the class of quasi-fair measures, namely measures that satisfy some fairness conditions on the updating sequences. Basic set properties like injectivity and surjectivity are adapted to the new setting and studied. In particular, we prove that they are dimensions sensitive properties (i.e., they are decidable in dimension 1 and undecidable in higher dimensions). A first exploration of dynamical properties is also started, some results about equicontinuity and expansivity behaviors are provided.