Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).

DOI10.1016/S0304-3975(03)00091-4zbMath1058.68083MaRDI QIDQ1426035

Ali Aberkane

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Quasi-Sturmian colorings on regular trees ⋮ ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS ⋮ Describing the Set of Words Generated by Interval Exchange Transformation ⋮ An explicit lower bound for the block complexity of an algebraic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences with subword complexity \(2n\)
• On the complexity of infinite sequences
• Sturmian morphisms
• Représentation géométrique de suites de complexité $2n+1$
• Minimal symbolic flows having minimal block growth
• Sequences with minimal block growth
• Examples of sequences of complexity less than \(2n\)

This page was built for publication: Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).