Complexity for infinite words associated with quadratic non-simple Parry numbers
The author recalls results about infinite sequences associated with \(\beta\)-expansions and gives an example of computation of their complexity (block-complexity).
scientific article; zbMATH DE number 5140518
scientific article