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 …

Given a set SS of words, one associates to each word ww in SS an undirected graph, called
its extension graph, and which describes the possible extensions of ww in SS on the left and …

Dimension groups are complete invariants of strong orbit equivalence for minimal Cantor
systems. This paper studies a natural family of minimal Cantor systems having a finitely …

Bifix codes and interval exchanges - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Dendric words are infinite words that are defined in terms of extension graphs. These are
bipartite graphs that describe the left and right extensions of factors. Dendric words are such …

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 symbolic …

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their
languages. This family generalizes well-known families of shifts such as Sturmian shifts …

This paper studies balancedness for infinite words and subshifts, both for letters and factors.
Balancedness is a measure of disorder that amounts to strong convergence properties for …

We study classes of minimal sets defined by restrictions on the possible extensions of the
words. These sets generalize the previously studied classes of neutral and tree sets by …

We define a new class of shift spaces which contains a number of classes of interest, like
Sturmian shifts used in discrete geometry. We show that this class is closed under two …