Sequences of low complexity: Automatic and Sturmian sequences
This survey/course summarizes arithmetic, combinatorial and measure-theoretic properties of two families of sequences over finite alphabets, namely automatic sequences and Sturmian (billiard) sequences. These sequences have a ``small block-complexity (more precisely the number of blocks of length \(n\) occurring in such a sequence is \(O(n)\)). We invite the reader to follow the author in her promenade where she quotes 74 papers. We only add page numbers to Reference [63], namely 4-01-4-27 (note that ``Séminaire de Théorie des Nombres should read ``Séminaire de Théorie des Nombres de Bordeaux), and year for Reference [73], namely either 1982 or 2000. NEWLINENEWLINENEWLINEFinally the following references have appeared: [15] J. Anal. Math. 79, 1-31 (1999; Zbl 0996.37006), [26] Theor. Comput. Sci. 230, 97-116 (2000; Zbl 0947.68543), [38] Ergodic Theory Dyn. Syst. 20, 1061-1078 (2000; Zbl 0965.37013), [43] Discrete Math. 206, 145-154 (1999; Zbl 0936.37008), [44] J. Number Theory 80, 1-24 (2000; Zbl 0974.11011).NEWLINENEWLINEFor the entire collection see [Zbl 0942.00028].
- Transcendence of numbers with a low complexity expansion
- Algorithmic analysis of irrational rotations in a single neuron model
- Complexity of Hartman sequences
- On the subword complexity of Thue-Morse polynomial extractions
- Subword complexity and projection bodies
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- Trajectories of rotations
- scientific article; zbMATH DE number 1163211 (Why is no real title available?)
- Minimum complexity of automatic non sturmian sequences
- Combinatorial properties of infinite words associated with cut-and-project sequences
- scientific article; zbMATH DE number 4185699 (Why is no real title available?)
- Complexity of automatic sequences
- Double sequences of low complexity
- Morphic sequences versus automatic sequences
- On the joint subword complexity of automatic sequences
- Maximal pattern complexity of higher dimensional words
- Puzzles of quasi-finite type, zeta functions and symbolic dynamics for multi-dimensional maps
This page was built for publication: Sequences of low complexity: Automatic and Sturmian sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711280)
