Translator Disclaimer
2006 Complexity for Infinite Words Associated with Quadratic Non-Simple Parry Numbers
Ľubomíra Balková
J. Geom. Symmetry Phys. 7: 1-11 (2006). DOI: 10.7546/jgsp-7-2006-1-11

Abstract

Studying of complexity of infinite aperiodic words, i.e., the number of different factors of the infinite word of a fixed length, is an interesting combinatorial problem. Moreover, investigation of infinite words associated with $\beta$-integers can be interpreted as investigation of one-dimensional quasicrystals. In such a way of interpretation, complexity corresponds to the number of local configurations of atoms.

Citation

Download Citation

Ľubomíra Balková. "Complexity for Infinite Words Associated with Quadratic Non-Simple Parry Numbers." J. Geom. Symmetry Phys. 7 1 - 11, 2006. https://doi.org/10.7546/jgsp-7-2006-1-11

Information

Published: 2006
First available in Project Euclid: 20 May 2017

zbMATH: 1117.68058
MathSciNet: MR2290122
Digital Object Identifier: 10.7546/jgsp-7-2006-1-11

Rights: Copyright © 2006 Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences

JOURNAL ARTICLE
11 PAGES


SHARE
Back to Top