In this paper, we study non-uniform elementary cellular automata on the infinite grid in the
context of number conservation. These automata operate in a one-dimensional setting …

The density classification problem is one of the most studied problems in the context of the
computational abilities of cellular automata. Since this problem cannot be solved in the …

Classification has been successfully applying in problems in a variety of fields, such as
science, business, engineering, and industry. Unfortunately, the classifier coping with …

This paper presents an investigation into the evolution and dynamics of the simplest
generalization of binary cellular automata: Affine continuous cellular automata (ACCAs) …

In this paper, the classical density classification problem is considered in the context of affine
continuous cellular automata. It has been shown earlier that there exists no general solution …

The aim of this paper is to solve the density classification task (DCT), an extensively studied
classical problem, using one-dimensional nonuniform Cellular Automata (CA) rules. A …

In this paper, the problem of identifying the cellular automata (CAs) is considered. We frame
and solve this problem in the context of incomplete observations, ie, prerecorded …

Almost four decades ago, Gacs, Kurdyumov, and Levin introduced three different cellular
automata to investigate whether one-dimensional nonequilibrium interacting particle …

The density classification problem (DCP) originally appeared in [1, 2] relates to binary
Cellular Automata (CA) and is straightforward to formulate. The goal is to define a CA that …

Abstract Cellular Automata (CAs) are dynamical systems, where time and space are
discrete. Most often, cell states take values from a finite set. State changes in subsequent …