• English
    • français
  • English 
    • English
    • français
Search 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-10 of 24

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

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)
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 ...
Thumbnail

A family of formulas with reversal of high avoidability index 

Currie, James; Mol, Lucas; Rampersad, Narad (World Scientific, 2017)
We present an infinite family of formulas with reversal whose avoidability index is bounded between 4 and 5, and we show that several members of the family have avoidability index 5. This family is particularly interesting ...
Thumbnail

Avoiding approximate repetitions with respect to the longest common subsequence distance 

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

Extremal words in morphic subshifts 

Zamboni, Luca Q.; Saari, Kalle; Rampersad, Narad; Currie, James D. (Elsevier, 2014-01-22)
Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of x an extremal word of ...
Thumbnail

Dejean's conjecture holds for n ≥ 27 

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

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)
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 ...
Thumbnail

Multi-dimensional sets recognizable in all abstract numeration systems 

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

On avoidability of formulas with reversal 

Currie, James D.; Mol, Lucas; Rampersad, Narad (EDP Sciences, 2018-02-13)
While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas ...
Thumbnail

Shuffling and unshuffling 

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

Overlap-Free Words and Generalizations 

Rampersad, Narad (University of Winnipeg, 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 ...
  • 1
  • 2
  • 3

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Discover

Author
Rampersad, Narad (24)
Currie, James D. (9)Currie, James (4)Shallit, Jeffrey (3)Charlier, Émilie (2)Lacroix, Anne (2)Mol, Lucas (2)Saari, Kalle (2)Aberkane, Ali (1)Blanchet-Sadri, F. (1)... View MoreSubjectInfinite words (2)Squares (2)approximate repetition (1)Automatic sequence (1)automaticity (1)Combinatorics on words (1)combinatorics on words, non-repetitive words, Abelian cubes, decision procedure, enumeration (1)combinatorics on words, pattern avoidance, patterns with reversal, avoidability index (1)critical exponent (1)Cubefree words (1)... View MoreDate Issued2010 - 2018 (18)2004 - 2009 (6)Has File(s)Yes (24)

Report a copyright concern

Contact Us | Send Feedback