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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Mike Müller received his degree in Computer Science at the University of Stuttgart in 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).
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Paperback. Condición: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G3734741971I2N00
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 23066001-n
Cantidad disponible: Más de 20 disponibles
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
Paperback or Softback. Condición: New. Avoiding and Enforcing Repetitive Structures in Words. Book. Nº de ref. del artículo: BBS-9783734741975
Cantidad disponible: 5 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 23066001
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783734741975
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783734741975
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783734741975_new
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783734741975
Cantidad disponible: 10 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 172 pp. Englisch. Nº de ref. del artículo: 9783734741975
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 23066001-n
Cantidad disponible: Más de 20 disponibles