Studies on finite Sturmian words
From MaRDI portal
Publication:2354408
DOI10.1016/j.tcs.2015.05.003zbMath1325.68174OpenAlexW2250680610MaRDI QIDQ2354408
Publication date: 13 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.003
normal formenumerationconjugationperiodsSturmian sequencesChristoffel wordspalindromesRauzy graphMarkoff numbersfinite Sturmian wordscircular factorsspecial words
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lyndon words and Fibonacci numbers
- A note on Sturmian words
- Substitutions in dynamics, arithmetics and combinatorics
- On factorially balanced sets of words
- On the number of factors of Sturmian words
- Lyndon + Christoffel = digitally convex
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- A combinatorial property of the Fibonacci words
- Relationship between the period of a finite word and the length of its unbordered segments
- Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
- Unbordered factors of the characteristic sequences of irrational numbers
- Certain words on the real projective line
- Some combinatorial properties of Sturmian words
- \(\alpha\)-words and factors of characteristic sequences
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Infinite words with linear subword complexity
- Moments of conjugacy classes of binary words
- Random generation of finite Sturmian words
- Bifix codes and Sturmian words
- Palindromes and Sturmian words
- Continued fractions and the Markoff tree
- On an involution of Christoffel words and Sturmian morphisms
- Codes of central Sturmian words
- Some characterizations of finite Sturmian words.
- On Markoff's property and Sturmian words
- On the structure of bispecial Sturmian words
- Markov's Theorem and 100 Years of the Uniqueness Conjecture
- MINIMAL DUVAL EXTENSIONS
- A linear algorithm for nonhomogeneous spectra of numbers
- Factorizing words over an ordered alphabet
- On Christoffel classes
- Sturmian and Episturmian Words
- Combinatorics on Words
- Automatic Sequences
- Episturmian morphisms and a Galois theorem on continued fractions
- Zeta Functions of Formal Languages
- A Note on a Conjecture of Duval and Sturmian Words
- Handbook of Enumerative Combinatorics
- On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- Sequences with minimal block growth
- Some properties of the singular words of the Fibonacci word
This page was built for publication: Studies on finite Sturmian words
