2 papers
math.CO2010
Palindromes In Sturmian Strings
Ayse Karaman
Let p be a maximal palindrome in a Sturmian word s=ul_1pl_2v so that p is a palindrome and l_1pl_2 is not for letters l_1 and l_2. Let α(p,p') be a morphism mapping letters a and b…
math.CO2010
Strong Repetitions in Sturmian Strings
Ayse Karaman
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to ou…