Stable Multi-Level Monotonic Eroders

09/25/2018
by   Péter Gács, et al.
0

Eroders are monotonic cellular automata with a linearly ordered state set that eventually wipe out any finite island of nonzero states. One-dimensional eroders were studied by Gal'perin in the 1970s, who presented a simple combinatorial characterization of the class. The multi-dimensional case has been studied by Toom and others, but no such characterization has been found. We prove a similar characterization for those one-dimensional monotonic cellular automata that are eroders even in the presence of random noise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

On the Garden of Eden theorem for non-uniform cellular automata

We establish several extensions of the well-known Garden of Eden theorem...
research
01/31/2022

On reversible asynchronous non-uniform cellular automata

We study the class of asynchronous non-uniform cellular automata (ANUCA)...
research
06/15/2021

Rice's theorem for generic limit sets of cellular automata

The generic limit set of a cellular automaton is a topologically dened s...
research
02/18/2020

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata

We show the surprising result that the cutpoint isolation problem is dec...
research
08/30/2018

Self-stabilizing Overlays for high-dimensional Monotonic Searchability

We extend the concept of monotonic searchability for self-stabilizing sy...
research
03/05/2020

Fuzzy k-Nearest Neighbors with monotonicity constraints: Moving towards the robustness of monotonic noise

This paper proposes a new model based on Fuzzy k-Nearest Neighbors for c...
research
01/29/2021

Self-stabilisation of cellular automata on tilings

Given a finite set of local constraints, we seek a cellular automaton (i...

Please sign up or login with your details

Forgot password? Click here to reset