Reversibility and surjectivity problems of 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
Global Properties of 2D Cellular Automata: Some Complexity Results
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
On Some Topological Properties of Linear Cellular Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Solution of some conjectures about topological properties of linear cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
Computational complexity of dynamical systems: The case of cellular automata
Information and Computation
Shifting and Lifting of Cellular Automata
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Topological Dynamics of 2D Cellular Automata
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Some formal properties of asynchronous callular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Non-uniform cellular automata: Classes, dynamics, and decidability
Information and Computation
Asynchronous cellular automata and dynamical properties
Natural Computing: an international journal
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
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 | 0.00 |
In this paper we study some decidable properties of two-dimensional cellular automata (2D CA). The notion of closingness is generalized to the 2D case and it is linked to permutivity and openness. The major contributions of this work are two deep constructions which have been fundamental in order to prove our new results and we strongly believe it will be a valuable tool for proving other new ones in the near future.