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

04/03/2023
by   Xuan Kien Phung, et al.
0

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the partial pre-injectivity and the size of the image of a non-uniform cellular automata. A strengthened surjunctivity result is also obtained for multi-dimensional cellular automata over strongly irreducible subshifts of finite type.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2022

On reversible asynchronous non-uniform cellular automata

We study the class of asynchronous non-uniform cellular automata (ANUCA)...
research
01/24/2019

Reachability Problem in Non-uniform Cellular Automata

This paper deals with the CREP (Configuration REachability Problem) for ...
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
09/25/2018

Stable Multi-Level Monotonic Eroders

Eroders are monotonic cellular automata with a linearly ordered state se...
research
08/05/2017

A Novel data Pre-processing method for multi-dimensional and non-uniform data

We are in the era of data analytics and data science which is on full bl...
research
10/23/2017

Conjugacy of one-dimensional one-sided cellular automata is undecidable

Two cellular automata are strongly conjugate if there exists a shift-com...
research
08/24/2015

An evolutionary approach to the identification of Cellular Automata based on partial observations

In this paper we consider the identification problem of Cellular Automat...

Please sign up or login with your details

Forgot password? Click here to reset