Complexity of sequences with values in a finite set: some examples

MaRDI QIDQ3656025zbMATH OpenFDO

Authors Pierre Arnoux

Publication date 13 January 2010

zbMATH Keywords

complexitycubic billiarddynamical systemssequencesTamura conjecture

Mathematics Subject Classification ID

Multiple sequences and series (40B99)

Recommendations

• On the complexity of infinite sequences
• Complexity of sequences and dynamical systems
• Sequences with subword complexity \(2n\)
• The complexity of generalized Sturmian sequences
• scientific article; zbMATH DE number 1163211

Cited in

(7)

• A simple characterization of Sturm numbers
• A set of sequences of complexity \(2n+1\)
• The complexity of generalized Sturmian sequences
• A diffraction abstraction
• Can you hear the shape of a Beatty sequence?
• An example of positive complex sequence which is not a moment complex sequence
• Examples of sequences of complexity less than 2n

This page was built for publication: Complexity of sequences with values in a finite set: some examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656025)