<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T14:22:40Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7737" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7737</identifier><datestamp>2017-03-21T20:24:43Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="ce6dde43-fe40-492e-b5b8-7fdf526a14c5" confidence="600">Mousavi Haji, Seyyed Hamoon</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-08-23T15:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-08-23T15:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-08-23T15:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2013-08-09</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7737</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The main topic of this thesis is combinatorics on words. The field of combinatorics on words dates back at least to the beginning of the 20th century when Axel Thue constructed an infinite squarefree sequence over a ternary alphabet. From this celebrated result also emerged the subfield of repetition in words which is the main focus of this thesis. &#xd;
&#xd;
One basic tool in the study of repetition in words is the iteration of morphisms. In Chapter 1, we introduce this tool among other basic notions. In Chapter 2, we see applications of iterated morphisms in several examples. The second half of the chapter contains a survey of results concerning Dejean&amp;apos;s conjecture. In Chapter 3, we generalize Dejean&amp;apos;s conjecture to circular factors. We see several applications of iterated morphism in this chapter. We continue our study of repetition in words in Chapter 4, where we study the length of the shortest repetition-free word in regular languages. Finally, in Chapter 5, we conclude by presenting a number of open problems.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">repetitions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorics on words</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Repetition in Words</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">This is a License Agreement between hamoon mousavi (&amp;quot;You&amp;quot;) and Springer (&amp;quot;Springer&amp;quot;). The license consists of your order details, the terms and conditions provided by Springer, and the payment terms and conditions.&#xd;
&#xd;
Get the printable license.&#xd;
&#xd;
License Number&#xd;
&#xd;
3210420251771&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
License date&#xd;
&#xd;
Aug 15, 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content publisher&#xd;
&#xd;
Springer&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content publication&#xd;
&#xd;
Springer eBook&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content title&#xd;
&#xd;
Repetition Avoidance in Circular Factors&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content author&#xd;
&#xd;
Hamoon Mousavi&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content date&#xd;
&#xd;
Jan 1, 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Type of Use&#xd;
&#xd;
Thesis/Dissertation&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Portion&#xd;
&#xd;
Full text&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Number of copies&#xd;
&#xd;
1&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Author of this Springer article&#xd;
&#xd;
Yes and you are a contributor of the new work&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Title of your thesis / dissertation&#xd;
&#xd;
repetition in words&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Expected completion date&#xd;
&#xd;
Aug 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Estimated size(pages)&#xd;
&#xd;
60&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Total&#xd;
&#xd;
0.00 USD&#xd;
-------------------------------&#xd;
This is a License Agreement between hamoon mousavi (&amp;quot;You&amp;quot;) and Springer (&amp;quot;Springer&amp;quot;). The license consists of your order details, the terms and conditions provided by Springer, and the payment terms and conditions.&#xd;
&#xd;
Get the printable license.&#xd;
&#xd;
License Number&#xd;
&#xd;
3210420412231&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
License date&#xd;
&#xd;
Aug 15, 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content publisher&#xd;
&#xd;
Springer&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content publication&#xd;
&#xd;
Springer eBook&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content title&#xd;
&#xd;
Shortest Repetition-Free Words Accepted by Automata&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content author&#xd;
&#xd;
Hamoon Mousavi&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Licensed content date&#xd;
&#xd;
Jan 1, 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Type of Use&#xd;
&#xd;
Thesis/Dissertation&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Portion&#xd;
&#xd;
Full text&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Number of copies&#xd;
&#xd;
1&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Author of this Springer article&#xd;
&#xd;
Yes and you are a contributor of the new work&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Title of your thesis / dissertation&#xd;
&#xd;
repetition in words&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Expected completion date&#xd;
&#xd;
Aug 2013&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Estimated size(pages)&#xd;
&#xd;
60&#xd;
&#xd;
 &#xd;
&#xd;
 &#xd;
&#xd;
Total&#xd;
&#xd;
0.00 USD</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>