Related papers: Explicit solution of the Cauchy problem for cellul…
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…
Determining properties of an arbitrary binary sequence is a challenging task if only local processing is allowed. Among these properties, the determination of the parity of 1s by distributed consensus has been a recurring endeavour in the…
We propose and investigate a probabilistic model of sublinear-time one-dimensional cellular automata. In particular, we modify the model of ACA (which are cellular automata that accept if and only if all cells simultaneously accept) so that…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
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…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
We study linear stochastic partial differential equations of parabolic type. We consider a new boundary value problem where a Cauchy condition is replaced by a prescribed average of the solution either over time and probabilistic space for…
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Cellular Automata (DECA), obtained as random mixture of two different Elementary Cellular Automata rules. All the cells are updated synchronously and…
We consider a Cauchy problem for the inhomogeneous differential equation given in terms of an unbounded linear operator $A$ and the Caputo fractional derivative of order $\alpha \in (0, 2)$ in time. The previously known representation of…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
The property of reversibility is quite meaningful for the classic theoretical computer science model, cellular automata. For the reversibility problem for a CA under null boundary conditions, while linear rules have been studied a lot, the…
We study the stochastic solution to a Cauchy problem for a degenerate parabolic equation arising from option pricing. When the diffusion coefficient of the underlying price process is locally H\"older continuous with exponent $\delta\in (0,…
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…
We consider the problem of finding the density of 1's in a configuration obtained by $n$ iterations of a given cellular automaton (CA) rule, starting from disordered initial condition. While this problems is intractable in full generality…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…