Results 21 to 30 of about 1,318,046 (112)
Occurrences of palindromes in characteristic Sturmian words [PDF]
, 2006 This paper is concerned with palindromes occurring in characteristic Sturmian words cα of slope α, where α∈(0,1) is an irrational. As cα is a uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα with ...
Glen, Amy, Glen, Amy Louise, Glen, A.
core +1 more source
On the Lie complexity of Sturmian words
Theoretical Computer Science, 2022 Bell and Shallit recently introduced the Lie complexity of an infinite word $s$ as the function counting for each length the number of conjugacy classes of words whose elements are all factors of $s$. They proved, using algebraic techniques, that the Lie complexity is bounded above by the first difference of the factor complexity plus one; hence, it is
Alessandro De Luca 0002, Gabriele Fici
openaire +6 more sources
Quasiperiodic and Lyndon episturmian words [PDF]
, 2008 Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if, it is an infinite Lyndon word.
Amy Glen +8 more
core +1 more source
Conjugates of characteristic Sturmian words generated by morphisms [PDF]
, 2004 This article is concerned with characteristic Sturmian words of slope α and 1-α (denoted by cα and c1-α resp.), where α∈(0,1) is an irrational number such that α=[0;1+d1,d2,..., dn] with dn≥d1≥1.
Glen, Amy +3 more
core +1 more source
Powers in a class of A-strict standard episturmian words [PDF]
, 2007 This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent ...
Glen, Amy, Glen, A.
core +1 more source
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Perrin, D, RESTIVO, Antonio
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 +6 more sources
Episturmian words: a survey [PDF]
, 2007 In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters.
Justin, J. +5 more
core +1 more source
Return words in Sturmian and episturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 2000 Summary: Considering each occurrence of a word \(w\) in a recurrent infinite word, we define the set of return words of \(w\) to be the set of all distinct words beginning with an occurrence of \(w\) and ending exactly just before the next occurrence of \(w\) in the infinite word. We give a simpler proof of the recent result (of the second author) that,
Jacques Justin, Laurent Vuillon
openaire +3 more sources
Sturmian words, Lyndon words and trees
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berstel, Jean, de Luca, Aldo
openaire +5 more sources