Eventually dendric shift spaces

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 natural transformations. The first one is called conjugacy and is obtained by sliding block coding. The second one is called the complete bifix decoding, and typically includes codings by non-overlapping blocks of fixed length.

[1]  C. Caramanis.  What is ergodic theory , 1963 .

[2]  M. Queffélec.  Substitution dynamical systems, spectral analysis , 1987 .

[3]  Gérard Rauzy,et al.  Représentation géométrique de suites de complexité $2n+1$ , 1991 .

[4]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[5]  Julien Cassaigne,et al.  Complexité et facteurs spéciaux , 1997 .

[6]  C. Mauduit,et al.  Substitutions in dynamics, arithmetics, and combinatorics , 2002 .

[7]  Edita Pelantová,et al.  Sequences with constant number of return words , 2006, ArXiv.

[8]  Jean Berstel,et al.  Bifix codes and Sturmian words , 2010, ArXiv.

[9]  J. Cassaigne,et al.  Combinatorics, Automata and Number Theory: Factor complexity , 2010 .

[10]  Julien Leroy,et al.  Do the Properties of an S-adic Representation Determine Factor Complexity? , 2013 .

[11]  Dominique Perrin,et al.  Bifix codes and interval exchanges , 2014, 1408.0389.

[12]  A. Maass,et al.  On automorphism groups of low complexity subshifts , 2015, Ergodic Theory and Dynamical Systems.

[13]  Christophe Reutenauer,et al.  Acyclic, connected and tree sets , 2013, Monatshefte für Mathematik.

[14]  Dominique Perrin,et al.  Maximal bifix decoding , 2013, Discret. Math..

[15]  Francesco Dolce,et al.  Decidable properties of extension graphs for substitutive languages , 2016 .

[16]  Dominique Perrin,et al.  Specular sets , 2015, Theoretical Computer Science.

[17]  Dominique Perrin,et al.  Neutral and tree sets of arbitrary characteristic , 2017, Theor. Comput. Sci..

[18]  Julien Leroy,et al.  Decidability of the isomorphism and the factorization between minimal substitution subshifts , 2018, ArXiv.

[19]  Dominique Perrin,et al.  Eventually Dendric Shifts , 2019, CSR.

[20]  Dominique Perrin,et al.  Return Words and Bifix Codes in Eventually Dendric Sets , 2019, WORDS.

[21]  The number of ergodic measures for transitive subshifts under the regular bispecial condition , 2019, Ergodic Theory and Dynamical Systems.