Related papers: Orbits in one-dimensional finite linear cellular a…
Periodicity and relaxation are investigated for the trajectories of the states in cylindrical linear cellular automata. The time evolutions are described with matrices. The eigenvalue analysis is applied to obtain the maximum values of…
In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…
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…
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…
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…
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,…
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…
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 define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a…
This is a study of the one-dimensional elementary cellular automaton rule 54 in the new formalism of "flexible time". We derive algebraic expressions for groups of several cells and their evolution in time. With them we can describe the…
We study the dynamics of the Rule 150 reversible cellular automaton (RCA). This is a one-dimensional lattice system of binary variables with synchronous (Floquet) dynamics, corresponding to a bulk deterministic and reversible discrete…
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…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
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.
Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…