Related papers: Non-Uniform Cellular Automata: classes, dynamics, …
This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences…
In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
This paper presents a rotation-invariant embedded platform for simulating (neural) cellular automata (NCA) in modular robotic systems. Inspired by previous work on physical NCA, we introduce key innovations that overcome limitations in…
Neural Cellular Automata (NCA) represent a powerful framework for modeling biological self-organization, extending classical rule-based systems with trainable, differentiable (or evolvable) update rules that capture the adaptive…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
The density classification (DC) task, a computation which maps global density information to local density, is studied using one-dimensional non-unitary quantum cellular automata (QCAs). Two approaches are considered: one that preserves the…
In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
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…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…
A cellular automata model that describes as limit cases of his parameters the spread of contagious diseases modeled by systems of ordinary or partial differential equations is developed. Periodic features of the behavior of human settlement…
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We…
This article introduces the notion of clouds in asynchronous cellular automata (ACAs). We show that the cloud behaviour of ACAs has similarity with natural clouds across the sky, election model of parliamentary democratic system, and…
Nonuniform families of polynomial-size finite automata, which are series of indexed finite automata having polynomially many inner states, are used in the past literature to solve nonuniform families of promise decision problems. Among such…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…