Results 11 to 20 of about 359 (107)
Rich, Sturmian, and trapezoidal words
Theoretical Computer Science, 2008 In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors.
De Luca, A., Glen, A., Zamboni, L.
openaire +6 more sources
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Perrin, D, RESTIVO, Antonio
openaire +6 more sources
Harmonic and gold Sturmian words
European Journal of Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARPI, Arturo, de Luca A.
core +4 more sources
Standard factors of Sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 2010 Summary: Among the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard. Nevertheless in any characteristic word \(c\), some standard words occur that are not prefixes of \(c\).
Richomme, Gwenaël +2 more
openaire +4 more sources
Abelian Repetitions in Sturmian Words [PDF]
, 2013 We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory.
Gabriele Fici +5 more
openaire +7 more sources
Dejean’s conjecture and Sturmian words
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morteza Mohammad Noori, James D. Currie
openaire +2 more sources
Lyndon factorization of sturmian words
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Melançon, Guy, Guy Melançon
openaire +3 more sources
Consecutive Power Occurrences in Sturmian Words
Comptes Rendus. MathématiqueWe show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by $10$ and this bound is optimal, extending a result of Rampersad, who proved that the bound $9 ...
Bell, Jason +2 more
doaj +3 more sources
Sturmian words and words with a critical exponent
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Circular sturmian words and Hopcroft’s algorithm
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
RESTIVO, Antonio +2 more
openaire +2 more sources