Repetition in Words
| dc.comment.hidden | This is a License Agreement between hamoon mousavi ("You") and Springer ("Springer"). The license consists of your order details, the terms and conditions provided by Springer, and the payment terms and conditions. Get the printable license. License Number 3210420251771 License date Aug 15, 2013 Licensed content publisher Springer Licensed content publication Springer eBook Licensed content title Repetition Avoidance in Circular Factors Licensed content author Hamoon Mousavi Licensed content date Jan 1, 2013 Type of Use Thesis/Dissertation Portion Full text Number of copies 1 Author of this Springer article Yes and you are a contributor of the new work Title of your thesis / dissertation repetition in words Expected completion date Aug 2013 Estimated size(pages) 60 Total 0.00 USD ------------------------------- This is a License Agreement between hamoon mousavi ("You") and Springer ("Springer"). The license consists of your order details, the terms and conditions provided by Springer, and the payment terms and conditions. Get the printable license. License Number 3210420412231 License date Aug 15, 2013 Licensed content publisher Springer Licensed content publication Springer eBook Licensed content title Shortest Repetition-Free Words Accepted by Automata Licensed content author Hamoon Mousavi Licensed content date Jan 1, 2013 Type of Use Thesis/Dissertation Portion Full text Number of copies 1 Author of this Springer article Yes and you are a contributor of the new work Title of your thesis / dissertation repetition in words Expected completion date Aug 2013 Estimated size(pages) 60 Total 0.00 USD | en |
| dc.contributor.author | Mousavi Haji, Seyyed Hamoon | |
| dc.date.accessioned | 2013-08-23T15:01:05Z | |
| dc.date.available | 2013-08-23T15:01:05Z | |
| dc.date.issued | 2013-08-23T15:01:05Z | |
| dc.date.submitted | 2013-08-09 | |
| dc.description.abstract | 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. 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's conjecture. In Chapter 3, we generalize Dejean'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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/7737 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | repetitions | en |
| dc.subject | combinatorics on words | en |
| dc.subject.program | Computer Science | en |
| dc.title | Repetition in Words | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |