Skip to the end of the images gallery Navigation umschalten
Skip to the beginning of the images gallery Navigation umschalten
Avoiding and Enforcing Repetitive Structures in Words
ePUB
13,3 MB
DRM: hartes DRM
ISBN-13: 9783738669046
Verlag: Books on Demand
Erscheinungsdatum: 15.12.2014
Sprache: Englisch
erhältlich als:
5,99 €
inkl. MwSt.
sofort verfügbar als Download
Bitte beachten Sie, dass Sie dieses E-Book nicht auf einem Amazon Kindle lesen können, sondern ausschließlich auf Geräten mit einer Software, die epub-Dateien anzeigen kann. Mehr Informationen
Um dieses DRM-geschützte E-Book lesen zu können, müssen Sie eine Adobe ID besitzen und eine Lesesoftware verwenden, die Adobe DRM verarbeitet. Mehr Informationen
Um dieses DRM-geschützte E-Book lesen zu können, müssen Sie eine Adobe ID besitzen und eine Lesesoftware verwenden, die Adobe DRM verarbeitet. Mehr Informationen
Ihr eigenes Buch!
Werden Sie Autor*in mit BoD und erfüllen Sie sich den Traum vom eigenen Buch und E-Book.
Mehr erfahrenAvoiding and enforcing repetitions in words are central topics in the area of combinatorics on words, with first results going back to the beginning of the 20th century.
The results presented in this thesis extend and enrich the existing theory concerning the presence and absence of repetitive structures in words.
In the first part the question whether such structures necessarily appear in infinite words over a finite alphabet is investigated.
In particular, avoidability questions of patterns whose repetitive structure is disguised by the application of a permutation are studied.
The second part deals with equations on words that enforce a certain repetitive structure involving involutions in their solution set.
A generalisation of the classical equations u^l = v^mw^n that were studied by Lyndon and Schützenberger is analysed.
The last part considers the influence of the shuffle operation on square-free words and related avoidability questions.
The results presented in this thesis extend and enrich the existing theory concerning the presence and absence of repetitive structures in words.
In the first part the question whether such structures necessarily appear in infinite words over a finite alphabet is investigated.
In particular, avoidability questions of patterns whose repetitive structure is disguised by the application of a permutation are studied.
The second part deals with equations on words that enforce a certain repetitive structure involving involutions in their solution set.
A generalisation of the classical equations u^l = v^mw^n that were studied by Lyndon and Schützenberger is analysed.
The last part considers the influence of the shuffle operation on square-free words and related avoidability questions.
Eigene Bewertung schreiben
Es sind momentan noch keine Pressestimmen vorhanden.