相关论文: Time-evolution of the Rule 150 cellular automaton …
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the…
In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix H_N with the aim of calculating the pseudo random sequences of N bits employing the…
We have proposed two new evolutionary rules on spatio-iterated games that is not mimic evolution of strategies, and mainly discussed the Prisoner's Dilemma game \cite{toyota2} by the two evoutionary rules \cite{toyota3}. In this paper we…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
We define a cellular automaton where a resting cell excites if number of its excited neighbours belong to some specified interval and boundaries of the interval change depending on ratio of excited and refractory neighbours in the cell's…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is pi-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the…
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…
Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of the states $0,1,..., n-1$, can you find out the most frequently occurring state using cellular automaton? Here, we prove that while the…
Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
Can we quantify the change of complexity throughout evolutionary processes? We attempt to address this question through an empirical approach. In very general terms, we simulate two simple organisms on a computer that compete over limited…
This paper proposes a new pattern of two dimensional cellular automata linear rules that are used for efficient edge detection of an image. Since cellular automata is inherently parallel in nature, it has produced desired output within a…
In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering…
For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
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…
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…
We systematically compute the power spectra of the one-dimensional elementary cellular automata introduced by Wolfram. On the one hand our analysis reveals that one automaton displays $1/f$ spectra though considered as trivial, and on the…
Cellular Automaton (CA) and an Integral Value Transformation (IVT) are two well established mathematical models which evolve in discrete time steps. Theoretically, studies on CA suggest that CA is capable of producing a great variety of…