Search

Filters

Use filters to refine the search results.

Now showing items 1-10 of 23

Dejean's conjecture holds for n ≥ 27

Currie, James; Rampersad, Narad (EDP Sciences, 2009)
Words with many palindrome pair factors

Borchert, Adam; Rampersad, Narad (The Electronic Journal of Combinatorics, 2015-10-30)
Shuffling and unshuffling

Henshall, Dane; Rampersad, Narad; Shallit, Jeffrey (Bulletin of the European Association for Theoretical Computer Science, 2012)
Avoiding approximate repetitions with respect to the longest common subsequence distance

Camungol, Serina; Rampersad, Narad (Mathematical Sciences Publishers, 2015-09-17)
Binary Words Containing Infinitely Many Overlaps

Currie, James D.; Rampersad, Narad; Shallit, Jeffrey (The Electronic Journal of Combinatorics, 2006-09-22)
Introduction: Special volume in honor of Jeffrey Shallit on the occasion of his 60th birthday

Rampersad, Narad (Integers, 2018-03)
For each a > 2 there is an Infinite Binary Word with Critical Exponent a

Currie, James D.; Rampersad, Narad (The Electronic Journal of Combinatorics, 2008-08-31)
Infinite words containing squares at every position

Currie, James; Rampersad, Narad (EDP Sciences, 2010)
Cyclic Complexity of Some Infinite Words and Generalizations

Krawchuk, Colin; Rampersad, Narad (Integers, 2018-03)
Abelian complexity of fixed point of morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1

Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan (Integers, 2014-02-20)

Now showing items 1-10 of 23