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

  • 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 .
  • Crochemore, Maxime; Currie, James D.; Kucherov, Gregory; Nowotka, Dirk (Dagstuhl Publishing, 2014-03-09)
    Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words ...
  • Currie, James D. (The Electronic Journal of Combinatorics, 1995-10-14)
    We can compress the word 'banana' as xyyz, where x= 'b', y= 'an',z= 'a'. We say that 'banana' encounters yy. Thus a 'coded' version of yy shows up in 'banana'. The relation 'u encounters w' is transitive, and thus generates ...
  • Allouche, Jean-Paul; Currie, James D.; Shallit, Jeffrey (The Electronic Journal of Combinatorics, 1998-05-03)
    Let t be the infinite fixed point, starting with 1, of the morphism μ:0→01, 1→10. An infinite word over {0,1} is said to be overlap-free if it contains no factor of the form axaxa, where a∈{0,1} and x∈{0,1}∗. We prove that ...
  • Currie, James D. (The Electronic Journal of Combinatorics, 2002-07-03)
    In 1906 Axel Thue showed how to construct an infinite non-repetitive (or square-free) word on an alphabet of size 3. Since then this result has been rediscovered many times and extended in many ways. We present a two-dimensional ...

View more