Avoiding and Enforcing Repetitive Structures in Words (ePub)
(Sprache: Englisch)
Avoiding 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 results presented in this thesis extend and enrich the existing theory concerning...
sofort als Download lieferbar
eBook (ePub)
5.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Avoiding and Enforcing Repetitive Structures in Words (ePub)“
Avoiding 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.
Autoren-Porträt von Mike Müller
Mike Müller received his degree in Computer Science at the University of Stuttgartin 2011.
From 2011 to 2014 he was research assistant in the Dependable Systems Group at the Kiel University, working on the project ``Combinatorial Aspects of Words and their Applications'' funded by the German Science Foundation (DFG).
Bibliographische Angaben
- Autor: Mike Müller
- 2015, 1. Auflage, 172 Seiten, Englisch
- Verlag: Books on Demand
- ISBN-10: 3738669043
- ISBN-13: 9783738669046
- Erscheinungsdatum: 08.01.2015
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: ePub
- Größe: 13 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Family Sharing
eBooks und Audiobooks (Hörbuch-Downloads) mit der Familie teilen und gemeinsam genießen. Mehr Infos hier.
Kommentar zu "Avoiding and Enforcing Repetitive Structures in Words"
0 Gebrauchte Artikel zu „Avoiding and Enforcing Repetitive Structures in Words“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Avoiding and Enforcing Repetitive Structures in Words".
Kommentar verfassen