相关论文: Orbits of One-Dimensional Cellular Automata Induce…
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…
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 search for symmetry as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have long been a central focus of complexity science and physics. To better grasp and understand symmetry…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
Some aspects of phase transitions can be more conveniently studied in the orbit space of the action of the symmetry group. After a brief review of the fundamental ideas of this approach, I shall concentrate on the mathematical aspect and…
The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…
It is known that orbit reduction can be performed in one or two stages and it has been proven that the two processes are symplectically equivalent. In the context of orbit reduction by one stage we shall write an expression for the reduced…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
It is shown that the set of orbits of the action of the elementary symplectic transvection group on all unimodular elements of a symplectic module over a commutative ring of characteristic not 2 is identical with the set of orbits of the…
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…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular-automaton analogous of localizations or…
We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…