Complexity for infinite words associated with quadratic non-simple Parry numbers
type: Item
instance of: scholarly article
title: Complexity for infinite words associated with quadratic non-simple Parry numbers
zbMATH Open document ID: 1117.68058
author: L'ubomira Balková
published in: Journal of Geometry and Symmetry in Physics
publication date: 2007-04-05T00:00:00Z
review text: The author recalls results about infinite sequences associated with \(\beta\)-expansions and gives an example of computation of their complexity (block-complexity).
reviewed by: Jean-Paul Allouche
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 11A63
zbMATH DE Number: 5140518
zbMATH Keywords: \(\beta\)-expansions
zbMATH Keywords: Parry numbers
zbMATH Keywords: block complexity
MaRDI profile type: Publication
Recommended article: Abelian complexity of infinite words associated with quadratic Parry numbers
Recommended article: Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
Recommended article: Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Recommended article: Palindromic complexity of infinite words associated with non-simple Parry numbers
Recommended article: Palindromic complexity of infinite words associated with simple Parry numbers
Recommended article: Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
Recommended article: Q5384332
Recommended article: On a class of infinite words with affine factor complexity
Recommended article: The Maximal Subword Complexity of Quasiperiodic Infinite Words
Recommended article: Q5492250
description: scientific article; zbMATH DE number 5140518