WinnSpace Repository

Welcome to the University of Winnipeg's WinnSpace digital repository. WinnSpace collects, preserves, and distributes digital material. Repositories are important tools for preserving an organization's legacy; they facilitate digital preservation and scholarly communication.

Communities in WinnSpace

Recently Added

  • 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 ...
  • 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 ...
  • 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.
  • 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 ...

View more