On low-complexity bi-infinite words and their factors
From MaRDI portal
Publication:1606164
DOI10.5802/jtnb.331zbMath1013.68155OpenAlexW1982901888MaRDI QIDQ1606164
Publication date: 24 July 2002
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_2001__13_2_421_0
Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Automata sequences (11B85)
Related Items (7)
Transcendence of Sturmian or morphic continued fractions ⋮ \(m\)-balanced words: A generalization of balanced words ⋮ Sturmian and Episturmian Words ⋮ Balance Properties and Distribution of Squares in Circular Words ⋮ Generalized trapezoidal words ⋮ BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS ⋮ The \(P(n)/n\)-function for bi-finite words
Cites Work
- Unnamed Item
- Unnamed Item
- On the number of factors of Sturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Intertwinings of periodic sequences
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- Certain words on the real projective line
- Sturmian morphisms and Rauzy's rules
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Représentation géométrique de suites de complexité $2n+1$
- Sequences with minimal block growth II
- Minimal symbolic flows having minimal block growth
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Descriptions of the Characteristic Sequence of an Irrational
- Sequences with minimal block growth
This page was built for publication: On low-complexity bi-infinite words and their factors
