56 citations · 118 across the 18 of their papers we have counts for
5 papers · 1 filter
An analogue of Cobham's theorem for graph directed iterated function systems
Emilie Charlier, Julien Leroy, Michel Rigo
Feng and Wang showed that two homogeneous iterated function systems in with multiplicatively independent contraction ratios necessarily have different attractors. In t…
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurren…
Acyclic, connected and tree sets
Valerie Berthé, Clelia De Felice, Francesco Dolce +4
Given a set of words, one associates to each word in an undirected graph, called its extension graph, and which describes the possible extensions of on the left and…
An -adic characterization of minimal subshifts with first difference of complexity
Julien Leroy
In [Ergodic Theory Dynam. System, 16 (1996) 663--682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is -adic with $\card S \leq…
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbo…