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. (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 ...
  • Currie, James D. (The Electronic Journal of Combinatorics, 2002-10-11)
    There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture of R. J. Simpson.
  • Aberkane, Ali; Currie, James D. (The Electronic Journal of Combinatorics, 2004-01-23)
    We show that there exist binary circular 5/2+ power free words of every length.

View more