• English
    • français
  • English 
    • English
    • français
Search 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • Search
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • 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-1 of 1

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

Non repetitive walks in graphs and digraphs 

Currie, James Daniel (The University of Calgary, 1987-06)
A word $w$ over alphabet $\Sigma$ is {\em non-repetitive} if we cannot write $w=abbc$, $a,b,c\in\Sigma^*$, $b\ne\epsilon$. That is, no subword of $w$ appears twice in a row in $w$. In 1906, Axel Thue, the Norwegian number ...

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Discover

AuthorCurrie, James Daniel (1)Subject
combinatorics on words, non-repetitive words, square-free words, words walked on graphs (1)
... View MoreDate Issued1987 (1)Has File(s)Yes (1)

Report a copyright concern

Contact Us | Send Feedback