An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product
of substitutions (ie, morphisms of a free monoid). Such a description is related to continued …

Recognizability for sequences of morphisms Page 1 Ergod. Th. & Dynam. Sys. (2019), 39,
2896–2931 doi:10.1017/etds.2017.144 c Cambridge University Press, 2018 Recognizability for …

We investigate several questions related to the notion of recognizable morphism. The main
result is a new proof of Mossé's theorem and actually of a generalization to a more general …

From a classical point of view, the domino problem is the question of the existence of an
algorithm which can decide whether a finite set of square tiles with colored edges can tile …

Shift spaces are sets of colorings of a group which avoid a set of forbidden patterns and are
endowed with a shift action. These spaces appear naturally as discrete versions of …

An S-adic system is a symbolic dynamical system generated by iterating an infinite
sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic …

It is possible to extend the notion of block gluing for subshifts studied in [PS15] adding a gap
function which gives the distance which allows to concatenate two rectangular blocks of the …

A subshift of finite type is a set of tilings of a group subject to a finite number of local
constraints, where the group acts by translation. In recent years, much progress has been …

This collaborative volume aims at presenting and developing recent trends at the interface
between the study of sequences, groups, and number theory, as the title may suggest. It is …

It is possible to define mixing properties for subshifts according to the intensity which allows
to concatenate two rectangular blocks. We study the interplay between this intensity and …