相关论文: Equality of cycle lengths in one- and two-dimensio…

We study one-dimensional cellular automata evolutions with both temporal and spatial periodicity. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period $\sigma$ and…

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…

The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules…

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…

A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…

The B36/S125 (or "2x2") cellular automaton is one that takes place on a 2D square lattice much like Conway's Game of Life. Although it exhibits high-level behaviour that is similar to Life, such as chaotic but eventually stable evolution…

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…

We study one-dimensional cellular automata whose rules are chosen at random from among $r$-neighbor rules with a large number $n$ of states. Our main focus is the asymptotic behavior, as $n \to \infty$, of the longest temporal period…

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…

A three-way (resp., two-way) two-dimensional automaton has a read-only input head that moves in three (resp., two) directions on a finite array of cells labelled by symbols of the input alphabet. Restricting the input head movement of a…

We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…

In this paper, we mainly study linear one-dimensional and two-dimensional elementary cellular automata that generate symmetrical spatio-temporal patterns. For spatio-temporal patterns of cellular automata from the single site seed, we…

Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

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…

We discuss a cellular automaton simulating the process of reaching Heider balance in a fully connected network. The dynamics of the automaton is defined by a deterministic, synchronous and global update rule. The dynamics has a very rich…

The emergence of complex structures in the systems governed by a simple set of rules is among the most fascinating aspects of Nature. The particularly powerful and versatile model suitable for investigating this phenomenon is provided by…

We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…

We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction…

In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…