Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Infinite special bra ...
Article

Infinite special branches in words associated with beta-expansions

Christiane Frougny (1), Zuzana Masáková (2), Edita Pelantová ORCID (2)
(1) Laboratoire d'informatique Algorithmique : Fondements et Applications
(2) Department of Mathematics [Prague]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:2
DOI
10.46298/dmtcs.415
License
https://about.hal.science/hal-authorisation-v1
Indicators
753
Views
664
Downloads

Infinite special branches in words associated with beta-expansions

Christiane Frougny (1), Zuzana Masáková (2), Edita Pelantová ORCID (2)
(1) Laboratoire d'informatique Algorithmique : Fondements et Applications
(2) Department of Mathematics [Prague]
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • factor complexity function
  • Parry numbers
Preview
Loading PDF preview...