Related papers: Explicit solution of the Cauchy problem for cellul…
For many cellular automata, it is possible to express the state of a given cell after $n$ iterations as an explicit function of the initial configuration. We say that for such rules the solution of the initial value problem can be obtained.…
We consider the problem of computing a response curve for binary cellular automata -- that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to…
In this paper we obtain necessary conditions and sufficient conditions on the initial data for the solvability of the Cauchy problem $$ \partial_t u+(-\Delta)^{\frac{\theta}{2}}u=u^p,\quad x\in{\bf R}^N,\,\,t>0, \qquad u(0)=\mu\ge…
There exists algorithms to detect reversibility of cellular automaton (CA) for both finite and infinite lattices taking quadratic time. But, can we identify a $d$-state CA rule in constant time that is always reversible for every lattice…
In the paper, a linear differential equation with variable coefficients and a Caputo fractional derivative is considered. For this equation, a Cauchy problem is studied, when an initial condition is given at an intermediate point that does…
We solve the Cauchy problem defined by the fractional partial differential equation $[\partial_{tt}-\kappa\mathbb{D}]u=0$, with $\mathbb{D}$ the pseudo-differential Riesz operator of first order, and the initial conditions…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
For a one-dimensional mildly quasilinear wave equation given in the upper half-plane, we consider the Cauchy problem. The initial conditions have discontinuity of the first kind at one point. We construct the solution using the method of…
The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an…
We prove the existence of a fundamental solution of the Cauchy initial boundary value problem on the whole space for a parabolic partial differential equation with discontinuous unbounded first-order coefficient at the origin. We establish…
In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…
The method of separation of variables can be used to solve many separable linear partial differential equations (LPDEs). Moreover, variable separation solutions usually are some trigonometric series. In the paper, base on some ideas of this…
In this paper, we deal with a Cauchy problem for a nonlinear fractional differential equation with the Caputo derivative of order $\alpha \in (0, 1)$. As initial data, we consider a pair consisting of an initial point, which does not…
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.
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
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…
The diffusion equation is a universal and standard textbook model for partial differential equations (PDEs). In this work, we revisit its solutions, seeking, in particular, self-similar profiles. This problem connects to the classical…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…