## Overlap-Free Words and Generalizations

dc.contributor.author | Rampersad, Narad | |

dc.date.accessioned | 2007-11-15 14:05:54 (GMT) | |

dc.date.available | 2007-11-15 14:05:54 (GMT) | |

dc.date.issued | 2007-11-15T14:05:54Z | |

dc.date.submitted | 2007 | |

dc.identifier.uri | http://hdl.handle.net/10012/3421 | |

dc.description.abstract | 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 no squares (identical adjacent blocks) xx. This result was eventually used to solve some longstanding open problems in algebra and has remarkable connections to other areas of mathematics and computer science as well. This thesis will consider several different generalizations of Thue's work. In particular we shall study the properties of infinite words avoiding various types of repetitions. In Chapter 1 we introduce the theory of combinatorics on words. We present the basic definitions and give an historical survey of the area. In Chapter 2 we consider the work of Thue in more detail. We present various well-known properties of the Thue-Morse word and give some generalizations. We examine Fife's characterization of the infinite overlap-free words and give a simpler proof of this result. We also present some applications to transcendental number theory, generalizing a classical result of Mahler. In Chapter 3 we generalize a result of Seebold by showing that the only infinite 7/3-power-free binary words that can be obtained by iterating a morphism are the Thue-Morse word and its complement. In Chapter 4 we continue our study of overlap-free and 7/3-power-free words. We discuss the squares that can appear as subwords of these words. We also show that it is possible to construct infinite 7/3-power-free binary words containing infinitely many overlaps. In Chapter 5 we consider certain questions of language theory. In particular, we examine the context-freeness of the set of words containing overlaps. We show that over a three-letter alphabet, this set is not context-free, and over a two-letter alphabet, we show that this set cannot be unambiguously context-free. In Chapter 6 we construct infinite words over a four-letter alphabet that avoid squares in any arithmetic progression of odd difference. Our constructions are based on properties of the paperfolding words. We use these infinite words to construct non-repetitive tilings of the integer lattice. In Chapter 7 we consider approximate squares rather than squares. We give constructions of infinite words that avoid such approximate squares. In Chapter 8 we conclude the work and present some open problems. | en |

dc.language.iso | en | en |

dc.publisher | University of Waterloo | en |

dc.subject | Combinatorics on words | en |

dc.title | Overlap-Free Words and Generalizations | en |

dc.type | Doctoral Thesis | en |

dc.pending | false | en |

dc.subject.program | Computer Science | en |

uws-etd.degree.department | School of Computer Science | en |

uws-etd.degree | Doctor of Philosophy | en |

uws.typeOfResource | Text | en |

uws.peerReviewStatus | Unreviewed | en |

uws.scholarLevel | Graduate | en |