Related papers: Asymptotic Randomization of Sofic Shifts by Linear…

In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…

The $\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we…

The problem of linear modulation classification using likelihood based methods is considered. Asymptotic properties of most commonly used classifiers in the literature are derived. These classifiers are based on hybrid likelihood ratio test…

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

We apply the recent results of F. Hiai, M. Mosonyi and T. Ogawa [arXiv:0707.2020, to appear in J. Math. Phys.] to the asymptotic hypothesis testing problem of locally faithful shift-invariant quasi-free states on a CAR algebra. We use a…

Let $\Delta\subsetneq\V$ be a proper subset of the vertices $\V$ of the defining graph of an aperiodic shift of finite type $(\Sigma_{A}^{+},\S)$. Let $\Delta_{n}$ be the union of cylinders in $\Sigma_{A}^{+}$ corresponding to the points…

A cellular automaton model is presented for random walkers with biologically motivated interactions favoring local alignment and leading to collective motion or swarming behavior. The degree of alignment is controlled by a sensitivity…

In this paper we derive the asymptotic properties of the least squares estimator (LSE) of autoregressive moving-average (ARMA) models with regime changes under the assumption that the errors are uncorrelated but not necessarily independent.…

We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…

Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…

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…

Revisiting the notion of m-almost equicontinuous cellular automata introduced by R. Gilman, we show that the sequence of image measures of a shift ergodic measure m by iterations of a m-almost equicontinuous automata F, converges in Cesaro…

We investigate the sensitivity of the composite cellular automaton of H. Fuk\'{s} [Phys. Rev. E 55, R2081 (1997)] to noise and assess the density classification performance of the resulting probabilistic cellular automaton (PCA)…

Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random…

In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…

We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…

In this article, we define amorphic complexity for actions of locally compact $\sigma$-compact amenable groups on compact metric spaces. Amorphic complexity, originally introduced for $\mathbb Z$-actions, is a topological invariant which…

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…

Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…

We construct an explicit algebraic example of a subshift of finite type over a group $\Gamma$ with an invariant Markov measure which has completely positive sofic entropy (with respect to `most' sofic approximations) and yet does not have a…