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

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

Skeleton Cave, Leigh Woods, Bristol 

Mullan, G. J.; Meiklejohn, C.; Babb, J. (University of Bristol Spelaeological Society, 2017)
An account is given of the discovery and excavation of this small cave in the 1960s. It is recorded that archaeological finds were made, but of these, only a single human mandible can now be traced. Radiocarbon dating shows ...
Thumbnail

Combinatorics and Algorithmics of Strings 

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

Unary patterns under permutations 

Currie, James D.; Nowotka, Dirk; Manea, Florin; Reshadi, Kamellia (Elsevier, 2018-06-04)
Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, ...
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

Square-free Words with Square-free Self-shuffles 

Currie, James D.; Saari, Kalle (The Electronic Journal of Combinatorics, 2014-01-12)
We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with a square-free self-shuffle.
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

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

The Aveline's Hole 9 Cranium: A Partial Solution to a Long Standing Enigma 

Meiklejohn, Christopher; Schulting, Rick; Musgrave, Jonathan; Babb, Jeff; Higham, Thomas; Richards, David; Mullan, Graham (University of Bristol Spelaeological Society, 2012)
Aveline's Hole is both one of the best-known sites with early human skeletal material in Britain and one of the most problematic in its history. First discovered and explored at the close of the 18th century, it yielded ...
Thumbnail

Avoidability index for binary patterns with reversal 

Currie, James D.; Lafrance, Phillip (2017)
For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.
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. ...
  • 1
  • 2
  • 3
  • 4

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Discover

AuthorRampersad, Narad (19)Currie, James D. (14)Babb, Jeff (3)Currie, James (3)Gosselin, Shonda (3)Saari, Kalle (3)Charlier, Émilie (2)Fox, Nathan (2)Lacroix, Anne (2)Meiklejohn, Christopher (2)... View MoreSubjectAveline's Hole (2)Complementing permutation (2)Infinite words (2)Self-complementary graphs (2)approximate repetition (1)automata (1)automaticity (1)Burrington Combe (1)Cemeteries -- England (1)combinatorics on words (1)... View MoreDate Issued2014 (6)2016 (5)2011 (4)2015 (4)2018 (4)2010 (3)2017 (3)2012 (2)2013 (1)2019 (1)Has File(s)Yes (33)

Report a copyright concern

Contact Us | Send Feedback