Combinatorics on Words

15th International Conference, WORDS 2025, Nancy, France, June 30 – July 4, 2025, Proceedings

AvGuilhem Gamard,Julien Leroy

Häftad, Engelska, 2025

Del 15729 i serien Lecture Notes in Computer Science

1 012 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 15th International Conference on Combinatorics on Words, WORDS 2025, held in Nancy, France, during June 30– July 4, 2025.The 20 papers included in these proceedings were carefully reviewed and selected from 31 submissions. They focus on mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized.

Produktinformation

Utgivningsdatum:2025-06-30
Mått:155 x 235 x 15 mm
Vikt:406 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:239
Förlag:Springer International Publishing AG
ISBN:9783031975479

Utforska kategorier

Innehållsförteckning

And Now There are Four: Another Brick in the Wall of the Optimal Upper Bound on the MP-ratio.- A Characterization of Algebraic Multivariate Power Series with Sparse Support.- Avoiding Abelian and Additive Powers in Rich Words.- Maximal 2-dimensional Binary Words of Bounded Degree.- Factorizations and Monoids.- Free Product of Formal Series.- Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems.- Words Avoiding Half-flips.- Digital Convexity and Combinatorics on Words.- Clustering of Return Words in Languages of Interval Exchanges.- Symmetries of Rich Sequences with Minimum Critical Exponent.- The Heineis Spectrum has Non-empty Interior.- Binomial Coefficients of Multidimensional Arrays.- Circularity and Repetitiveness in Non-injective DF0L Systems.- Shuffle Squares and Nest-Free Graphs.- A Succinct Study of Positionality for Dumont--Thomas Numeration Systems.- About ∆-numeration.- Purely Automatic Sequences with the Uniform Distribution Property.- On the Closed-rich Constant of Infinite Words.- Note on Dissecting Power of Regular Languages.