Christiane Frougny ; Zuzana Masáková ; Edita Pelantová - Infinite special branches in words associated with beta-expansions

dmtcs:415 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 2 -
Infinite special branches in words associated with beta-expansions

Authors: Christiane Frougny 1; Zuzana Masáková 2; Edita Pelantová ORCID-iD2

  • 1 Laboratoire d'informatique Algorithmique : Fondements et Applications
  • 2 Department of Mathematics [Prague]

A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous work we have determined the complexity of the fixed point uβ of the canonical substitution associated with β-expansions, when β is a simple Parry number. In this paper we consider the case where β is a non-simple Parry number. We determine the structure of infinite left special branches, which are an important tool for the computation of the complexity of uβ. These results allow in particular to obtain the following characterization: the infinite word uβ is Sturmian if and only if β is a quadratic Pisot unit.

Volume: Vol. 9 no. 2
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: factor complexity function,Parry numbers,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0019-3577(99)80010-x
  • 10.1016/s0019-3577(99)80010-x
On the minimal complexity of infinite words

Consultation statistics

This page has been seen 199 times.
This article's PDF has been downloaded 175 times.