Examples of sequences of complexity less than 2n

MaRDI QIDQ5952897zbMATH OpenFDO

Authors Ali Aberkane

Publication date 14 January 2002

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

zbMATH Keywords

Rauzy graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sequences with subword complexity \(2n\)
• scientific article; zbMATH DE number 2051150
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Représentation géométrique de suites de complexité 2n+1
• Complexity of sequences with values in a finite set: some examples

Cited in

(7)

• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• A set of sequences of complexity \(2n+1\)
• An isolated point in the Heinis spectrum
• scientific article; zbMATH DE number 6130246 (Why is no real title available?)
• On the complexity function for sequences which are not uniformly recurrent
• Low complexity subshifts have discrete spectrum
• An explicit lower bound for the block complexity of an algebraic number

This page was built for publication: Examples of sequences of complexity less than \(2n\)

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