Complexity for infinite words associated with quadratic non-simple Parry numbers (Q874377)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity for infinite words associated with quadratic non-simple Parry numbers |
scientific article |
Statements
Complexity for infinite words associated with quadratic non-simple Parry numbers (English)
0 references
5 April 2007
0 references
The author recalls results about infinite sequences associated with \(\beta\)-expansions and gives an example of computation of their complexity (block-complexity).
0 references
\(\beta\)-expansions
0 references
Parry numbers
0 references
block complexity
0 references
