Rank and symbolic complexity
From MaRDI portal
Recommendations
Cites work
Cited in
(52)- Complexity of sequences and dynamical systems
- Measure-theoretic complexity of ergodic systems
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Forbidden words in symbolic dynamics
- Substitution-based structures with absolutely continuous spectrum
- Dynamical systems arising from random substitutions
- The Hölder property for the spectrum of translation flows in genus two
- On Sarnak's conjecture and Veech's question for interval exchanges
- On sets of indefinitely desubstitutable words
- Complexity of nilsystems and systems lacking nilfactors
- A computer search for planar substitution tilings with \(n\)-fold rotational symmetry
- Subshifts with slow complexity and simple groups with the Liouville property
- Maximal bifix decoding
- Topological mixing for some residual sets of interval exchange transformations
- The complexity threshold for the emergence of Kakutani inequivalence
- Finite rank Bratteli diagrams: structure of invariant measures
- There exists a topologically mixing interval exchange transformation
- Invariant measures for Cantor dynamical systems
- Graph towers, laminations and their invariant measures
- The rank of regular morse dynamical systems
- Minimal Cantor Systems and Unimodal Maps
- Hereditary properties of words
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- A generalization of the self-dual induction to every interval exchange transformation
- Disjointness of Moebius from horocycle flows
- -adic characterization of minimal ternary dendric shifts
- Introduction to hierarchical tiling dynamical systems
- S-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Recognizability for sequences of morphisms
- Characterization of infinite LSP words and endomorphisms preserving the LSP property
- The complexity of Fibonacci-like kneading sequences
- Combinatorial properties of infinite words associated with cut-and-project sequences
- Interplay between finite topological rank minimal Cantor systems, S-adic subshifts and their complexity
- Two-dimensional iterated morphisms and discrete planes
- Slow entropy for some Anosov-Katok diffeomorphisms
- Low complexity subshifts have discrete spectrum
- Dynamical properties of minimal Ferenczi subshifts
- Measure-theoretically mixing subshifts with low complexity
- Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton
- Structure of K-interval exchange transformations: induction, trajectories, and distance theorems
- Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts
- Some improvements of the S-adic conjecture
- The Jacobs-Keane theorem from the \(\mathcal{S}\)-adic viewpoint
- On finite spacer rank for words and subshifts
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- S-adic conjecture and Bratteli diagrams
- \(\mathcal{S}\)-adic characterization of minimal dendric shifts
- Translation algorithms for graph covers
- Subshifts of finite symbolic rank
- Measure transfer and S-adic developments for subshifts
- Measure-theoretically mixing subshifts of minimal word complexity
- An explicit lower bound for the block complexity of an algebraic number
This page was built for publication: Rank and symbolic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4892463)
