Related papers: Classification of Backward Filtrations and Factor …
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a…
This paper reports on patterns exhibiting self-replication with spontaneous, inheritable mutations and exponential genetic drift in Neural Cellular Automata. Despite the models not being explicitly trained for mutation or inheritability,…
We establish new connections between percolation, bootstrap percolation, probabilistic cellular automata and deterministic ones. Surprisingly, by juggling with these in various directions, we effortlessly obtain a number of new results in…
The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the…
State-of-the-art review of cellular automata, cellular automata for partial differential equations, differential equations for cellular automata and pattern formation in biology and engineering.
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
In this paper, we consider certain $\sigma$-finite measures which can be interpreted as the output of a linear filter. We assume that these measures have regularly varying tails and study whether the input to the linear filter must have…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
A family of reversible deterministic cellular automata, including the rules 54 and 201 of [Bobenko et al., Commun. Math. Phys. 158, 127 (1993)] as well as their kinetically constrained quantum (unitary) or stochastic deformations, is shown…
Probabilistic cellular automata are prototypes of non equilibrium critical phenomena. This class of models includes among others the directed percolation problem (Domany Kinzel model) and the dynamical Ising model. The critical properties…
Backward Filtering Forward Guiding (BFFG) is a bidirectional algorithm proposed in Mider et al. [2021] and studied more in depth in a general setting in Van der Meulen and Schauer [2022]. In category theory, optics have been proposed for…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inally based on the function of natural dendritic cells. The original instantiation of the algorithm is a highly stochastic algorithm. While the performance of the algorithm…
We demonstrate that the concept of a conservation law can be naturally extended from deterministic to probabilistic cellular automata (PCA) rules. The local function for conservative PCA must satisfy conditions analogous to conservation…