We investigate topological mixing of compatible random substitutions. For primitive random
substitutions on two letters whose second eigenvalue is greater than one in modulus, we …

We consider a two-parameter family of random substitutions and show certain combinatorial
and topological properties they satisfy. We establish that they admit recognisable words at …

We consider shift spaces generated by maps that send a letter from a finite alphabet to a
finite collection of words over the same alphabet called random substitutions. In particular …

A central motive of this thesis is the study of configurations with aperiodic order. Here, a
configuration may refer to a bi-infinite sequence of symbols, a tiling of the plane or a …

We study a class of dynamical systems generated by random substitutions, which contains
both intrinsically ergodic systems and instances with several measures of maximal entropy …

A two-dimensional substitution is a function that maps every letter in an alphabet to a
predetermined rectangular word. It is said to be rectangular-preserving if any letter can be …

We consider shift spaces generated by maps, called random substitutions, that send a letter
from a finite alphabet to a finite collection of words over the same alphabet. Specifically, we …

The combinatorial and topological properties of a large family of random substitutions, called
the noble Pisa random substitutions, are studied. It is shown that each member of this family …