Modified complexity and *-Sturmian word (Q1302093): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3792/pjaa.75.26 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002327233 / rank | |||
Normal rank |
Revision as of 22:01, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modified complexity and *-Sturmian word |
scientific article |
Statements
Modified complexity and *-Sturmian word (English)
0 references
17 January 2000
0 references
The authors introduce a new notion of complexity \(p^*\) for an infinite sequence over a finite alphabet. Instead of counting all the factors (blocks) of given length occurring in the sequence, they count all the blocks of given length that occur infinitely often in the sequence. Accordingly they define *-Sturmian words. For a sequence indexed by \(\mathbb{N}\) these are exactly the sequences for which \(p^*(n)\leq n+1\) \(\forall n\geq 1\). The paper announces many interesting results.
0 references
block-complexity
0 references
Sturmian sequences
0 references
infinite sequence
0 references