On the complexity function for sequences which are not uniformly recurrent

DOI10.1090/conm/736/14833zbMath1430.37014arXiv1907.06626OpenAlexW2973564858MaRDI QIDQ5210869

Nic Ormes, Ronnie Pavlov

Publication date: 22 January 2020

Published in: Dynamical Systems and Random Processes (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.06626

zbMATH Keywords

symbolic dynamicsword complexityminimaltransitiveuniquely ergodic

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Ergodicity, mixing, rates of mixing (37A25) Symbolic dynamics (37B10) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)

Related Items (3)

Subsystems of transitive subshifts with linear complexity ⋮ Low complexity subshifts have discrete spectrum ⋮ On the structure of generic subshifts

Cites Work

• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• A unique ergodicity of minimal symbolic flows with linear block growth
• The \(P(n)/n\)-function for bi-finite words
• Counting generic measures for a subshift of linear growth
• Minimal symbolic flows having minimal block growth
• Introduction to Dynamical Systems
• Examples of sequences of complexity less than \(2n\)

This page was built for publication: On the complexity function for sequences which are not uniformly recurrent