WinnSpace Repository

Browsing Narad Rampersad by Title

Browsing Narad Rampersad by Title

Sort by: Order: Results:

  • Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan (Integers, 2014-02-20)
    We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0→012, 1→ 02, 2→1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds applications ...
  • Lacroix, Anne; Rampersad, Narad (Discrete Mathematics and Theoretical Computer Science, 2013)
    If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all ...
  • Camungol, Serina; Rampersad, Narad (Mathematical Sciences Publishers, 2015-09-17)
    Ochem, Rampersad, and Shallit gave various examples of infinite words avoiding what they called approximate repetitions. An approximate repetition is a factor of the form x x', where x and x' are close to being identical. ...
  • Currie, James D.; Rampersad, Narad; Shallit, Jeffrey (The Electronic Journal of Combinatorics, 2006-09-22)
    We characterize the squares occurring in infinite overlap-free binary words and construct various α power-free binary words containing infinitely many overlaps.
  • Currie, James D.; Rampersad, Narad (Discrete Mathematics and Theoretical Computer Science, 2014-05-13)
    We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.
  • Currie, James; Rampersad, Narad (EDP Sciences, 2009)
    We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.
  • Currie, James D.; Rampersad, Narad (The Electronic Journal of Combinatorics, 2008-08-31)
    The critical exponent of an infinite word w is the supremum of all rational numbers α such that w contains an α-power. We resolve an open question of Krieger and Shallit by showing that for each α>2 there is an infinite ...
  • Rampersad, Narad (The Electronic Journal of Combinatorics, 2011-06-21)
    In combinatorics on words, a word w over an alphabet ∑ is said to avoid a pattern p over an alphabet ∆ if there is no factor x of w and no non-erasing morphism h from ∆* to ∑* such that h(p) = x. Bell and Goh have recently ...
  • Currie, James; Rampersad, Narad (EDP Sciences, 2010)
    Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there exists an infinite word that avoids α-powers but contains arbitrarily large squares beginning at every position? We resolve ...
  • Currie, James D.; Saari, Kalle (EDP Sciences, 2009)
    We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci ...
  • Charlier, Émilie; Rampersad, Narad; Rigo, Michel; Waxweiler, Laurent (Integers, 2011-12-02)
    We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component ...
  • Charlier, Émilie; Lacroix, Anne; Rampersad, Narad (EDP Sciences, 2011)
    We prove that the subsets of Nd that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.
  • Rampersad, Narad (University of Waterloo, 2007)
    The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains ...
  • Henshall, Dane; Rampersad, Narad; Shallit, Jeffrey (Bulletin of the European Association for Theoretical Computer Science, 2012)
    We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal ...
  • Borchert, Adam; Rampersad, Narad (The Electronic Journal of Combinatorics, 2015-10-30)
    Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word ...

Search WinnSpace

Advanced Search


My Account