On low-complexity bi-infinite words and their factors
type: Item
instance of: scholarly article
title: On low-complexity bi-infinite words and their factors
zbMATH Open document ID: 1013.68155
author: Alex Heinis
published in: Journal de Théorie des Nombres de Bordeaux
publication date: 2002-07-24T00:00:00Z
full work available at URL: http://www.numdam.org/item
full work available at URL: https://eudml.org/doc/229420
full work available at URL: jourelec
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 11B85
zbMATH DE Number: 1770779
zbMATH Keywords: bi-infinite words
MaRDI profile type: Publication
OpenAlex ID: W1982901888
cites work: Représentation géométrique de suites de complexité $2n+1$
cites work: Sturmian words, Lyndon words and trees
cites work: Q3714479
cites work: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
cites work: Certain words on the real projective line
cites work: Descriptions of the Characteristic Sequence of an Irrational
cites work: Sequences with minimal block growth II
cites work: Sequences with minimal block growth
cites work: The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
cites work: Q5831393
cites work: Some combinatorial properties of Sturmian words
cites work: On the number of factors of Sturmian words
cites work: Sturmian morphisms and Rauzy's rules
cites work: Minimal symbolic flows having minimal block growth
cites work: Beatty Sequences, Continued Fractions, and Certain Shift Operators
cites work: Intertwinings of periodic sequences
DOI: 10.5802/JTNB.331
Recommended article: On a class of infinite words with affine factor complexity
Recommended article: Q3687742
Recommended article: Biinfinite words with maximal recurrent unbordered factors.
Recommended article: Q4291434
Recommended article: Asymptotic behaviour of bi-infinite words
Recommended article: A characterization of periodicity of bi-infinite words
Recommended article: Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
Recommended article: On repeated factors in \(C^\infty\)-words
Recommended article: Construction of a bi-infinite power free word with a given factor and a non-recurrent letter
Recommended article: Factor versus palindromic complexity of uniformly recurrent infinite words
description: scientific article; zbMATH DE number 1770779