Related papers: Differentiable cellular automata
As one of the emerging algorithms in the field of Artificial Immune Systems (AIS), the Dendritic Cell Algorithm (DCA) has been successfully applied to a number of challenging real-world problems. However, one criticism is the lack of a…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
We develop a theory characterizing the fundamental capability of deep neural networks to learn, from evolution traces, the logical rules governing the behavior of cellular automata (CA). This is accomplished by first establishing a novel…
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…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
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…
In this work we introduce a deterministic scheme of synchronization of linear and nonlinear cellular automata (CA) with complex behavior, connected through a master-slave coupling. By using a definition of Boolean derivative, we use the…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
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…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
New Cellular Automata associated with the Schroedinger discrete spectral problem are derived. These Cellular Automata possess an infinite (countable) set of constants of motion.
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…
This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and…
This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern…
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer…
After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors…
Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…