We extend previously known two-dimensional multiplication tiling systems that simulate multiplication by two natural numbers p and q in base $pq$ to higher dimensional multiplication tessellation systems. We develop the theory of these systems and link different multiplication tessellation systems with each other via macrotile operations that glue cubes in one tessellation system into larger cubes of another tessellation system. The macrotile operations yield topological conjugacies and factor maps between cellular automata performing multiplication by positive numbers in various bases.

We show that there is a distortion element in a finitely generated subgroup G of the automorphism group of the full shift, namely an element of infinite order whose word norm grows polylogarithmically. As a corollary, we obtain a lower bound on the entropy dimension of any subshift containing a copy of G, and that a sofic shift’s automorphism group contains a distortion element if and only if the sofic shift is uncountable. We obtain also that groups of Turing machines and the higher-dimensional Brin–Thompson groups $mV$ admit distortion elements; in particular, $2V$ (unlike V) does not admit a proper action on a CAT$(0)$ cube complex. In each case, the distortion element roughly corresponds to the SMART machine of Cassaigne, Ollinger, and Torres-Avilés [A small minimal aperiodic reversible Turing machine. J. Comput. System Sci. 84 (2017), 288–301].

We show that the image of a subshift X under various injective morphisms of symbolic algebraic varieties over monoid universes with algebraic variety alphabets is a subshift of finite type, respectively a sofic subshift, if and only if so is X. Similarly, let G be a countable monoid and let A, B be Artinian modules over a ring. We prove that for every closed subshift submodule $\Sigma \subset A^G$ and every injective G-equivariant uniformly continuous module homomorphism $\tau \colon \! \Sigma \to B^G$, a subshift $\Delta \subset \Sigma $ is of finite type, respectively sofic, if and only if so is the image $\tau (\Delta )$. Generalizations for admissible group cellular automata over admissible Artinian group structure alphabets are also obtained.

We present a new sufficient criterion to prove that a non-sofic half-synchronized subshift is direct prime. The criterion is based on conjugacy invariant properties of Fischer graphs of half-synchronized shifts. We use this criterion to show as a new result that all n-Dyck shifts are direct prime, and we also give new proofs of direct primeness of non-sofic beta-shifts and non-sofic S-gap shifts. We also construct a class of non-sofic synchronized direct prime subshifts which additionally admit reversible cellular automata with all directions sensitive.

For any infinite transitive sofic shift X we construct a reversible cellular automaton (that is, an automorphism of the shift X) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing directions. This shows in addition that every infinite transitive sofic shift has a reversible cellular automaton which is sensitive with respect to all directions. As another application we prove a finitary version of Ryan’s theorem: the automorphism group $\operatorname {\mathrm {Aut}}(X)$ contains a two-element subset whose centralizer consists only of shift maps. We also show that in the class of S-gap shifts these results do not extend beyond the sofic case.

We consider backward filtrations generated by processes coming from deterministic and probabilistic cellular automata. We prove that these filtrations are standard in the classical sense of Vershik’s theory, but we also study them from another point of view that takes into account the measure-preserving action of the shift map, for which each sigma-algebra in the filtrations is invariant. This initiates what we call the dynamical classification of factor filtrations, and the examples we study show that this classification leads to different results.

One of the most remarkable aspects of human homoeostasis is bone remodelling. This term denotes the continuous renewal of bone that takes place at a microscopic scale and ensures that our skeleton preserves its full mechanical compliance during our lives. We propose here that a renewal process of this type can be represented at an algorithmic level as the interplay of two different but related mechanisms. The first of them is a preliminary screening process, by means of which the whole skeleton is thoroughly and continuously explored. This is followed by a renovation process, whereby regions previously marked for renewal are first destroyed and then rebuilt, in such a way that global mechanical compliance is never compromised. In this work, we pay attention to the first of these two stages. In particular, we show that an efficient screening mechanism may arise out of simple local rules, which at the biological level are inspired by the possibility that individual bone cells compute signals from their nearest local neighbours. This is shown to be enough to put in place a process which thoroughly explores the region where such mechanism operates.

We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full shift (hence a transitive subshift) that is neither almost mean equicontinuous nor mean sensitive.

In this paper we analyse the non-wandering set of one-dimensional Greenberg–Hastings cellular automaton models for excitable media with $e\geqslant 1$ excited and $r\geqslant 1$ refractory states and determine its (strictly positive) topological entropy. We show that it results from a Devaney chaotic closed invariant subset of the non-wandering set that consists of colliding and annihilating travelling waves, which is conjugate to a skew-product dynamical system of coupled shift dynamics. Moreover, we determine the remaining part of the non-wandering set explicitly as a Markov system with strictly less topological entropy that also scales differently for large $e,r$.

Abelian cellular automata (CAs) are CAs which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images have weak*-convergence towards the uniform Bernoulli measure (the Haar measure in this setting). We are interested in structural phenomena, i.e., randomization for a wide class of initial measures (under some mixing hypotheses). First, we prove that an abelian CA randomizes in Cesàro mean if and only if it has no soliton, i.e., a non-zero finite configuration whose time evolution remains bounded in space. This characterization generalizes previously known sufficient conditions for abelian CAs with scalar or commuting coefficients. Second, we exhibit examples of strong randomizers, i.e., abelian CAs randomizing in simple convergence; this is the first proof of this behaviour to our knowledge. We show, however, that no CA with commuting coefficients can be strongly randomizing. Finally, we show that some abelian CAs achieve partial randomization without being randomizing: the distribution of short finite words tends to the uniform distribution up to some threshold, but this convergence fails for larger words. Again this phenomenon cannot happen for abelian CAs with commuting coefficients.

Floor field methods are one of the most popular medium-scale navigation concepts in microscopic pedestrian simulators. Recently introduced dynamic floor field methods have significantly increased the realism of such simulations, i.e. agreement of spatio-temporal patterns of pedestrian densities in simulations with real world observations. These methods update floor fields continuously taking other pedestrians into account. This implies that computational times are mainly determined by the calculation of floor fields. In this work, we propose a new computational approach for the construction of dynamic floor fields. The approach is based on the one hand on adaptive grid concepts and on the other hand on a directed calculation of floor fields, i.e. the calculation is restricted to the domain of interest. Combining both techniques the computational complexity can be reduced by a factor of 10 as demonstrated by several realistic scenarios. Thus on-line simulations, a requirement of many applications, are possible for moderate realistic scenarios.

In order to model the dispersal of volcanic particles in the atmosphere and their deposition on the ground, one has to simulate an advection-diffusion-sedimentation process on a large spatial area. Here we compare a Lattice Boltzmann and a Cellular Automata approach. Our results show that for high Peclet regimes, the cellular automata model produce results that are as accurate as the lattice Boltzmann model and is computationally more effective.

Lorsqu'on observe des orbites de certains automates cellulaires, on peut penser qu'elles apparaissent comme des mélanges d'orbites d'autres automates (composants). Dans cet article, nous tentons de comprendre ce phénomène en construisant un hybride de deux automates au moyen d'un troisième. Deux types d'automates cellulaires sont introduits : les captifs et les foulards. Nous comparons des propriétés de ces hybrides dans le cadre des classifications algébriques introduites par [B. Martin (2001) ; N. Ollinger (2002) ; I. Rapaport (1998) ; G. Teyssier (2005) : PhD. Thesis, École Normale Supérieure de Lyon].

This paper deals with the realization of a CA model of the physical interactions occurring when high-power laser pulses are focused on plasma targets. The low-level and microscopic physical laws of interactions among the plasma and the photons in the pulse are described. In particular, electron–electron interaction via the Coulomb force and photon–electron interaction due to ponderomotive forces are considered. Moreover, the dependence on time and space of the index of refraction is taken into account, as a consequence of electron motion in the plasma. Ions are considered as a fixed background. Simulations of these interactions are provided in different conditions and the macroscopic dynamics of the system, in agreement with the experimental behavior, are evidenced.

We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version of NC-PCA, and prove that a reversible NC-PCA is computation-universal. It is proved by showing that a reversible two-counter machine, which has been known to be universal, can be simulated by a reversible NC-PCA.

The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied. Processors are arranged as an array of m rows and n columns and can exchange each other only one bit of information. We give algorithms which synchronize square arrays of (n × n) processors and give some general constructions to synchronize arrays of (m × n) processors. Algorithms are given to synchronize in time n2, $n \lceil \log n\rceil$, $n\lceil\sqrt n \rceil$ and 2n a square array of (n × n) processors. Our approach is a modular description of synchronizing algorithms in terms of "fragments" of cellular automata that are called signals. Compositional rules to obtain new signals (and new synchronization times) starting from known ones are given for an (m × n) array. Using these compositional rules we construct synchronizations in any "feasible" linear time and in any time expressed by a polynomial with nonnegative coefficients.

We define a kind of cellular automaton called a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA H1, and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of H1 is concluded. Although the number of states of H1 is greater than those of the previous models of reversible CAs having universality, the size of the configuration realizing a Fredkin gate is greatly reduced, and its local transition function is still simple. Comparison with the previous models, and open problems related to these model are also discussed.