In this article, we investigate the possibility of generating all the configurations of a subshift
in a local way. We propose two definitions of local generation, explore their properties and …

In this paper, we introduce a framework for studying a subshift of finite type (SFT) with noise,
allowing some amount of forbidden patterns to appear. Using the Besicovitch distance …

The purpose of this article is to study the algorithmic complexity of the Besicovitch stability of
noisy subshifts of finite type, a notion studied in a previous article. First, we exhibit an …

Invariant sets and nilpotency of endomorphisms of algebraic sofic shifts Page 1 Ergod. Th. &
Dynam. Sys., page 1 of 42 © The Author(s), 2024. Published by Cambridge University Press …

In this paper, we are interested in computability aspects of subshifts and in particular Turing
degrees of two-dimensional subshifts of finite type (SFTs)(ie, tilings). To be more precise, we …

String attractors are a combinatorial tool coming from the field of data compression. It is a set
of positions within a word which intersects an occurrence of every factor. While one-sided …

We study implications of expansiveness and pointwise periodicity for certain groups and
semigroups of transformations. Among other things we prove that every pointwise periodic …

We investigate the computational properties of cellular automata on countable (equivalently,
zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic …

In this paper we emphasize the links between model theory and tilings. More precisely, after
giving the definitions of what tilings are, we give a natural way to have an interpretation of …

Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can
generalize this notion considering any set of patterns. Generalized tilings defined in this way …