Sequences of low complexity: Automatic and Sturmian sequences

MaRDI QIDQ2711280zbMATH OpenFDO

Authors Valérie Berthé

Publication date 6 May 2001

zbMATH Keywords

automatic sequencescoursefrequency of lettersrotationsspecial factorsSturmian sequencessurveytranscendence in positive characteristic

Mathematics Subject Classification ID

Automata sequences (11B85) Transcendence (general theory) (11J81) Symbolic dynamics (37B10) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1163211
• Double sequences of low complexity
• Publication:5750927
• Sequences with subword complexity \(2n\)
• Complexity of automatic sequences

Cited in

(18)

• 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)