A lower bound for the arithmetical complexity of Sturmian words (Q2498100)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the arithmetical complexity of Sturmian words |
scientific article |
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
