Related papers: Classification of Cellular Automata based on Stati…
We present numerical results obtained from the modelling of a stochastic, highly connected and mobile community. The spread of attributes like health, disease among the community members is simulated using cellular automata on a planar 2…
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…
Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution. Such a feat would require scaling up current simulation sizes to allow for…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
We demonstrate that the concept of a conservation law can be naturally extended from deterministic to probabilistic cellular automata (PCA) rules. The local function for conservative PCA must satisfy conditions analogous to conservation…
Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial…
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…
Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the…
An important question to be addressed regarding system control on a time interval $[0, T]$ is whether some particular target state in the configuration space is reachable from a given initial state. When the target of interest refers only…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…
We present a novel form of Liquid Automata, using this to simulate autopoiesis, whereby living machines self-organise in the physical realm. This simulation is based on an earlier Cellular Automaton described by Francisco Varela. The basis…
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…
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
We develop a rather elaborate computer program to investigate the jointly periodic points of one-dimensional cellular automata. The experimental results and mathematical context lead to questions, conjectures and a contextual theorem.
In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series applications. Besides selecting the models' hyperparameters, the proposed algorithm particularly solves…
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) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…