Complexity for infinite words associated with quadratic non-simple Parry numbers (Q874377)
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 5140518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity for infinite words associated with quadratic non-simple Parry numbers |
scientific article; zbMATH DE number 5140518 |
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
0.9614579
0 references
0.9539273
0 references
0.95022625
0 references
0.92814016
0 references
0.9180124
0 references
0.8842193
0 references
0.8757221
0 references
0.87372875
0 references
0 references
