A lower bound for the arithmetical complexity of Sturmian words (Q2498100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5049510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the arithmetical complexity of Sturmian words |
scientific article; zbMATH DE number 5049510 |
Statements
A lower bound for the arithmetical complexity of Sturmian words (English)
0 references
24 August 2006
0 references
infinite words
0 references
sequences with minimal block growth
0 references
possible growth of arithmetical complexity
0 references
sequence entropy
0 references
0.9168147444725036
0 references
0.8197198510169983
0 references
0.7969391942024231
0 references
0.7894781231880188
0 references
0.7853246927261353
0 references
