The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity

05/18/2022
by   Yonatan Nakar, et al.
0

We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius r. We introduce a notion that we term cell stability with which we express the structure of the possible configurations that could emerge in this setting. Our main finding is that apart from the configurations of the form (0^r+10^* + 1^r+11^*)^*, which are always fixed-points, the other configurations that the automata could possibly converge to, which are known to be either fixed-points or 2-cycles, have a particular spatially periodic structure. Namely, each of these configurations is of the form s^* where s consists of O(r^2) consecutive sequences of cells with the same state, each such sequence is of length at most r, and the total length of s is O(r^2) as well. We show that an analogous result also holds for the minority rule.

READ FULL TEXT
research
02/21/2022

Generating Hard Problems of Cellular Automata

We propose two hard problems in cellular automata. In particular the pro...
research
08/19/2019

Freezing, Bounded-Change and Convergent Cellular Automata

This paper studies three classes of cellular automata from a computation...
research
02/14/2022

Forming Point Patterns by a Probabilistic Cellular Automata Rule

The objective is to find a Cellular Automata rule that can form a 2D poi...
research
09/07/2022

Physical configurations of a cell doublet with line tension, a theoretical study

As a first approximation, early embryos may be modeled as foams whose sh...
research
10/11/2002

On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

This paper studies complexity of recognition of classes of bounded confi...
research
10/15/2017

Nivat's conjecture holds for sums of two periodic configurations

Nivat's conjecture is a long-standing open combinatorial problem. It con...
research
03/07/2014

On the Sequence of State Configurations in the Garden of Eden

Autonomous threshold element circuit networks are used to investigate th...

Please sign up or login with your details

Forgot password? Click here to reset