The following pages link to Rank and symbolic complexity (Q4892463):
Displaying 16 items.
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm (Q477772) (← links)
- A generalization of the self-dual induction to every interval exchange transformation (Q486829) (← links)
- The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
- Combinatorial properties of infinite words associated with cut-and-project sequences (Q558162) (← links)
- Two-dimensional iterated morphisms and discrete planes (Q596051) (← links)
- Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems (Q628370) (← links)
- Some improvements of the \(S\)-adic conjecture (Q651048) (← links)
- \(S\)-adic conjecture and Bratteli diagrams (Q694692) (← links)
- Hereditary properties of words (Q4680726) (← links)
- -adic characterization of minimal ternary dendric shifts (Q5053864) (← links)
- Recognizability for sequences of morphisms (Q5235114) (← links)
- Interplay between finite topological rank minimal Cantor systems, 𝒮-adic subshifts and their complexity (Q5857747) (← links)
- Slow entropy for some Anosov-Katok diffeomorphisms (Q6039822) (← links)
- Low complexity subshifts have discrete spectrum (Q6052080) (← links)
- Dynamical properties of minimal Ferenczi subshifts (Q6068431) (← links)
- Measure-theoretically mixing subshifts with low complexity (Q6106093) (← links)
