Rigidity and Substitutive Dendric Words
From MaRDI portal
Publication:4683228
DOI10.1142/S0129054118420017zbMath1448.68365OpenAlexW2802228513WikidataQ129400409 ScholiaQ129400409MaRDI QIDQ4683228
Valérie Berthé, Dominique Perrin, Fabien Durand, Julien Leroy, Francesco Dolce
Publication date: 20 September 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118420017
Related Items (9)
How to prove that a sequence is not automatic ⋮ -adic characterization of minimal ternary dendric shifts ⋮ Column representation of Sturmian words in cellular automata ⋮ On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts ⋮ Some properties of morphic images of (eventually) dendric words ⋮ Balancedness and coboundaries in symbolic systems ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ On Substitutions Preserving Their Return Sets ⋮ On non-repetitive complexity of Arnoux-Rauzy words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
- Selfdual substitutions in dimension one
- Cobham's theorem for substitutions
- Some improvements of the \(S\)-adic conjecture
- Substitutions in dynamics, arithmetics and combinatorics
- Neutral and tree sets of arbitrary characteristic
- On stabilizers of infinite words
- Weak mixing and eigenvalues for Arnoux-Rauzy sequences
- Non topologically weakly mixing interval exchanges
- On the conjugation of standard morphisms
- Power of words and recognizability of fixpoints of a substitution
- Sturmian morphisms and Rauzy's rules
- Strong orbit realization for minimal homeomorphisms
- A characterization of substitutive sequences using return words
- Conjugacy and episturmian morphisms.
- Some remarks on invertible substitutions on three letter alphabet.
- Tree-shifts of finite type
- The structure of invertible substitutions on a three-letter alphabet
- Bifix codes and Sturmian words
- The finite index basis property
- Some remarks about stabilizers
- Acyclic, connected and tree sets
- Syndeticity and independent substitutions
- Maximal bifix decoding
- HD0L-$\omega$-equivalence and periodicity problems in the primitive case (to the memory of G. Rauzy)
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- Initial powers of Sturmian sequences
- The spectrum of dynamical systems arising from substitutions of constant length
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Reconnaissabilité des substitutions et complexité des suites automatiques
- An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
- Beyond substitutive dynamical systems: S-adic expansions
- On substitution invariant Sturmian words: an application of Rauzy fractals
This page was built for publication: Rigidity and Substitutive Dendric Words
