Related papers: Loop Patterns Formed by Cellular Automata
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream sequences. In this paper we present two families of…
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…
In three spatial dimensions, communication channels are free to pass over or under each other so as to cross without intersecting; in two dimensions, assuming channels of strictly positive thickness, this is not the case. It is natural,…
We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…
The phase diagram of the coupled sine circle map lattice shows spatio-temporal intermittency of two distinct types: spatio-temporal intermittency of the directed percolation (DP) class, and spatial intermittency which does not belong to…
We present herein an introduction to implementing 2-color cellular automata on quantum annealing systems, such as the D-Wave quantum computer. We show that implementing nearest-neighbor cellular automata is possible. We present an…
It is shown that for the N-neighbor and K-state cellular automata, the class II, class III and class IV patterns coexist at least in the range $\frac{1}{K} \le \lambda \le 1-\frac{1}{K} $. The mechanism which determines the difference…
The objective is to find a Cellular Automata (CA) rule that can evolve 2D patterns that are optimal with respect to a global fitness function. The global fitness is defined as the sum of local computed utilities. A utility or value function…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…
Living organisms interact with their surroundings in a closed-loop fashion, where sensory inputs dictate the initiation and termination of behaviours. Even simple animals are able to develop and execute complex plans, which has not yet been…
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…
We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…
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 a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). According to the proposed approach, neighborhood is detected by…
Controllability, one of the fundamental concepts in control theory, consists in guiding a system from an initial state to a desired one within a limited (and possibly minimum) time interval. When the objective is limited to a specific…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…
While binary nearest-neighbour cellar automata (CA) have been studied in detail and from many different angles, the same cannot be said about ternary (three-state) CA rules. We present some results of our explorations of a small subset of…
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
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…