Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
type: Item
instance of: scholarly article
title: Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
zbMATH Open document ID: 1058.68083
DOI: 10.1016/S0304-3975(03)00091-4
author: Ali Aberkane
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 2056470
MaRDI profile type: Publication
cites work: Examples of sequences of complexity less than \(2n\)
cites work: On the complexity of infinite sequences
cites work: Représentation géométrique de suites de complexité $2n+1$
cites work: Sturmian morphisms
cites work: Sequences with minimal block growth
cites work: Q4784598
cites work: Q4529547
cites work: Minimal symbolic flows having minimal block growth
cites work: Q3338346
cites work: Sequences with subword complexity \(2n\)
description: scientific article; zbMATH DE number 2056470