Related papers: Explicit solution of the Cauchy problem for cellul…
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
We show the short time existence and uniqueness of solutions to the Cauchy problem for fully nonlinear systems of arbitrary even order on closed manifolds which are strongly parabolic at the initial values. The proof uses a linearization…
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…
In this paper, we mainly study linear one-dimensional and two-dimensional elementary cellular automata that generate symmetrical spatio-temporal patterns. For spatio-temporal patterns of cellular automata from the single site seed, we…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility…
We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. While there is no one-dimensional two-state, radius $r \geq 1$,…
This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…
The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
The compact explicit expressions for formal exact operator solutions to Cauchy problem for sufficiently general systems of nonlinear differential equations (ODEs and PDEs) in the form of chronological operator exponents are given. The…
We summarize a recent study of discrete (integer-valued) Hamiltonian cellular automata (CA) showing that their dynamics can only be consistently defined, if it is linear in the same sense as unitary evolution described by the Schr\"odinger…
Problem for the first order differential equation with an unbounded operator coefficient in Banach space and nonlinear nonlocal condition is considered. A numerical method is proposed and justified for the solution of this problem under…
The Majority (or Density Classification) Problem in Cellular Automata (CA) aims to converge a string of cells to a final homogeneous state which reflects the majority of states present in the initial configuration. The problem is…
The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem. In this paper we present a new two-dimensional CA model for solid dynamics. In this model the solid body is represented by a set of…
In this dissertation, we study temporally stochasticity in cellular automata and the behavior of such cellular automata. The work also explores the computational ability of such cellular automaton that illustrates the computability of…
For a class of partial differential algebraic equations (PDAEs) of quasi-linear type which include nonlinear terms of convection type a possibility to determine a time and spatial index is considered. As a typical example we investigate an…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…