Related papers: AutomataGPT: Forecasting and Ruleset Inference for…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
Cellular automata (CA) exemplify systems where simple local interaction rules can lead to intricate and complex emergent phenomena at large scales. The various types of dynamical behavior of CA are usually categorized empirically into…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
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…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more…
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
Cellular automata (CA) dynamics are ordered in terms of two global parameters, computable {\sl a priori} from the description of rules. While one of them (activity) has been used before, the second one is new; it estimates the average…
Cellular automata (CA) can be viewed as maps in the space of probability measures. Such maps are normally infinitely-dimensional, and in order to facilitate investigations of their properties, especially in the context of applications,…
In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
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…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…