Self-stabilisation of cellular automata on tilings

01/29/2021
by   Nazim Fatès, et al.
0

Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and parallel algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a valid configuration, the cellular automaton must eventually fall back to the space of valid configurations where it remains still. We allow the cellular automaton to use extra symbols, but in that case, the extra symbols can also appear in the initial finite perturbation. For several classes of local constraints (e.g., k-colourings with k≠ 3, and North-East deterministic constraints), we provide efficient self-stabilising cellular automata with or without additional symbols that wash out finite perturbations in linear or quadratic time, but also show that there are examples of local constraints for which the self-stabilisation problem is inherently hard. We also consider probabilistic cellular automata rules and show that in some cases, the use of randomness simplifies the problem. In the deterministic case, we show that if finite perturbations are corrected in linear time, then the cellular automaton self-stabilises even starting from a random perturbation of a valid configuration, that is, when errors in the initial configuration occur independently with a sufficiently low density.

READ FULL TEXT

page 5

page 22

page 32

research
10/03/2022

Some pointwise and decidable properties of non-uniform cellular automata

For non-uniform cellular automata (NUCA) with finite memory over an arbi...
research
01/26/2023

Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata

Many decision problems concerning cellular automata are known to be deci...
research
05/29/2010

Failover in cellular automata

A cellular automata (CA) configuration is constructed that exhibits emer...
research
02/21/2022

Generating Hard Problems of Cellular Automata

We propose two hard problems in cellular automata. In particular the pro...
research
10/01/2021

Bootstrap Percolation and Cellular Automata

We study qualitative properties of two-dimensional freezing cellular aut...
research
09/25/2018

Stable Multi-Level Monotonic Eroders

Eroders are monotonic cellular automata with a linearly ordered state se...
research
02/08/2011

Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems

We present a method to eliminate redundancy in the transition tables of ...

Please sign up or login with your details

Forgot password? Click here to reset