On the dynamical behaviour of linear higher-order cellular automata and its decidability

by   Alberto Dennunzio, et al.

Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many applications (ranging, for instance, from the design of secret sharing schemes to data compression and image processing), and in which the global state of the system at time t depends not only on the state at time t-1, as in the original model, but also on the states at time t-2, ..., t-n, where n is the memory size of the HOCA. We provide decidable characterizations of two important dynamical properties, namely, sensitivity to the initial conditions and equicontinuity, for linear HOCA over the alphabet Z_m. Such characterizations extend the ones shown in [23] for linear CA (LCA) over the alphabet Z^n_m in the case n=1. We also prove that linear HOCA of size memory n over Z_m form a class that is indistinguishable from a specific subclass of LCA over Z_m^n. This enables to decide injectivity and surjectivity for linear HOCA of size memory n over Z_m using the decidable characterization provided in [2] and [19] for injectivity and surjectivity of LCA over Z^n_m. Finally, we prove an equivalence between LCA over Z_m^n and an important class of non-uniform CA, another variant of CA used in many applications.


page 1

page 2

page 3

page 4


Some pointwise and decidable properties of non-uniform cellular automata

For non-uniform cellular automata (NUCA) with finite memory over an arbi...

On reversible asynchronous non-uniform cellular automata

We study the class of asynchronous non-uniform cellular automata (ANUCA)...

On linear non-uniform cellular automata: duality and dynamics

For linear non-uniform cellular automata (NUCA) over an arbitrary univer...

A robust image-based cryptology scheme based on cellular non-linear network and local image descriptors

Cellular nonlinear network (CNN) provides an infrastructure for Cellular...

Reachability Problem in Non-uniform Cellular Automata

This paper deals with the CREP (Configuration REachability Problem) for ...

Cellular automata can classify data by inducing trajectory phase coexistence

We show that cellular automata can classify data by inducing a form of d...

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata

After an apparent hiatus of roughly 30 years, we revisit a seemingly neg...

Please sign up or login with your details

Forgot password? Click here to reset