Repetitive subwords
The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetitions. More specifically we will consider repeating scattered subwords of non-primitive words, i.e. words which are complete repetitions of other words. We will present inequalities concernin...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universitat Rovira i virgili (URV) |
| Repositorio: | Repositori Institucional de la Universitat Rovira i Virgili |
| OAI Identifier: | oai:urv.cat:TDX:576 |
| Acceso en línea: | https://hdl.handle.net/20.500.11797/TDX576 http://hdl.handle.net/10803/8798 |
| Access Level: | acceso abierto |
| Palabra clave: | 51 - Matemàtiques 004 - Informàtica |
| Sumario: | The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetitions. More specifically we will consider repeating scattered subwords of non-primitive words, i.e. words which are complete repetitions of other words. We will present inequalities concerning these occurrences as well as giving apartial solutionto an openproblemposedby Salomaaet al. We will characterize languages, whichare closed under the operation ofduplication, thatis repeating any factor of a word. We alsogive newbounds onthe number of occurrencesof certain types of repetitions of words. We give a solution to an open problem posed by Calbrix and Nivat concerning regular languages consisting of non-primitive words. We alsopresentsomeresultsregarding theduplication closureoflanguages,among which a new proof to a problem of Bovet and Varricchio. |
|---|