相关论文: Linear cellular automata, asymptotic randomization…
This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…
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…
Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize…
Let $A$ be a unital AH-algebra and let $\alpha\in Aut(A)$ be an automorphism. A necessary condition for $A\rtimes_{\alpha}\Z$ being embedded into a unital simple AF-algebra is the existence of a faithful tracial state. If in addition, there…
The one-dimensional three-state cyclic cellular automaton is a simple spatial model with three states in a cyclic "rock-paper-scissors" prey-predator relationship. Starting from a random configuration, similar states gather in increasingly…
Random walks on a group $G$ model many natural phenomena. A random walk is defined by a probability measure $p$ on $G$. We are interested in asymptotic properties of the random walks and in particular in the linear drift and the asymptotic…
We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
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…
This paper considers non-negative integer-valued autoregressive processes where the autoregression parameter is close to unity. We consider the asymptotics of this `near unit root' situation. The local asymptotic structure of the likelihood…
Two cellular automata are strongly conjugate if there exists a shift-commuting conjugacy between them. We prove that the following two sets of pairs $(F,G)$ of one-dimensional one-sided cellular automata over a full shift are recursively…
Let $\Cal S$ be an abelian group of automorphisms of a probability space $(X, {\Cal A}, \mu)$ with a finite system of generators $(A_1, ..., A_d)$. Let $A^{\el}$ denote $A_1^{\ell_1} ... A_d^{\ell_d}$, for ${\el}= (\ell_1, ..., \ell_d)$. If…
A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…
In this work we are going to study the dynamics of the linear automorphisms of a measure convolution algebra over a finite group, $T(\mu)=\nu * \mu$. In order to understand an classify the asymptotic behavior of this dynamical system we…
We prove that the restriction of a probability measure invariant under a nonhyperbolic, ergodic and totally irreducible automorphism of a compact connected abelian group to the leaves of the central foliation is severely restricted. We also…
We revisit the problem of finding the conditions under which synchronous probabilistic cellular automata indexed by the line $\mathbb{Z}$, or the periodic line $\cyl{n}$, depending on 2 neighbours, admit as invariant distribution the law of…
In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…