Combinatorics on Words

CHF 80.75
Auf Lager
SKU
L8DONB5OPAS
Stock 1 Verfügbar
Geliefert zwischen Do., 06.11.2025 und Fr., 07.11.2025

Details

This book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019.

The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.


Inhalt

Matching patterns with variables.- Abelian properties of words.- On sets of words of rank two.- On families of limit S-adic words.- Independent systems of word equations: from Ehrenfeucht to eighteen.- Parikh determinants.- Critical exponent of infinite balanced words via the Pell number system.- Repetitions in infinite palindrome-rich words.- Generalized Lyndon factorizations of infinite words.- On the commutative equivalence of bounded semi-linear codes.- Circularly squarefree words and unbordered conjugates: a new approach.- The undirected repetition threshold.- Characteristic parameters and special trapezoidal words.- Return words and bifix codes in eventually dendric sets.- Enumeration and extensions of word-representable graphs.- Localisation-resistant random words with small alphabets.- On codeword lengths guaranteeing synchronization.- Binary intersection revisited.- On substitutions closed under derivation: examples.- Templates for the k-binomial complexity of the Tribonacci word.- Derived sequences of Arnoux-Rauzy sequences.- New results on pseudosquare avoidance.- Every nonnegative real number is a critical abelian exponent.- Rich words containing two given factors.- Mortality and synchronization of unambiguous finite automata.- On discrete idempotent paths.

<p

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783030287955
    • Editor Daniel Reidenbach, Robert Merca
    • Sprache Englisch
    • Auflage 1st edition 2019
    • Größe H235mm x B155mm x T19mm
    • Jahr 2019
    • EAN 9783030287955
    • Format Kartonierter Einband
    • ISBN 3030287955
    • Veröffentlichung 09.08.2019
    • Titel Combinatorics on Words
    • Untertitel 12th International Conference, WORDS 2019, Loughborough, UK, September 9-13, 2019, Proceedings
    • Gewicht 522g
    • Herausgeber Springer International Publishing
    • Anzahl Seiten 344
    • Lesemotiv Verstehen
    • Genre Informatik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470