Rank and symbolic complexity

DOI10.1017/S0143385700009032zbMATH Open0858.68051OpenAlexW2028740471MaRDI QIDQ4892463FDOQ4892463

Authors: Sébastien Ferenczi 

Publication date: 15 September 1996

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0143385700009032

Recommendations

• Measure-theoretic complexity of ergodic systems
• Complexity of sequences and dynamical systems
• The rank of regular morse dynamical systems
• Complexity for finite factors of infinite sequences
• Sequences with subword complexity \(2n\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Uniform tag sequences
• Symbolic Dynamics
• Transformations With Discrete Spectrum are Stacking Transformations
• A New Proof for a Metrically Transitive System

Cited In (46)

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

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)