From One-dimensional to Two-dimensional Cellular Automata

Authors:
Alberto Dennunzio
Affiliations:
(Correspd.) Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, 20126 Milano, Italy and Laboratoire I3S, Université Nice ...
Venue:
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Year:
2012

Citing 19
Cited 4

The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Regular Article: The surjectivity problem for 2D cellular automata

Proceedings of the 30th IEEE symposium on Foundations of computer science
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm

Theoretical Computer Science
A new kind of science

A new kind of science
Number conserving cellular automata II: dynamics

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 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
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
On the undecidability of the limit behavior of Cellular Automata

Theoretical Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Four states are enough!

Theoretical Computer Science
Topological Dynamics of Cellular Automata: Dimension Matters

Theory of Computing Systems
Limit Sets of Stable and Unstable Cellular Automata

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata

Fundamenta Informaticae - Cellular Automata

Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood

Natural Computing: an international journal
Explicit routing schemes for implementation of cellular automata on processor arrays

Natural Computing: an international journal
m-Asynchronous cellular automata: from fairness to quasi-fairness

Natural Computing: an international journal
Computing Issues of Asynchronous CA

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We enlighten the differences between one-dimensional and two-dimensional cellular automata by considering both the dynamical and decidability aspects. We also show a canonical representation theorem for the slicing constructions, a tool allowing to give the 2D version of important 1D CA notions as closing and positive expansivity and lift 1D results to the 2D settings.