Frid / Mercas / Mercas Combinatorics on Words

14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings
1. Auflage 2023
ISBN: 978-3-031-33180-0
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 13899, 301 Seiten, eBook

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023.The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS  is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics

Zielgruppe

Research

Autoren/Hrsg.

Frid, Anna

Mercas, Robert

Inhaltsverzeichnis

Invited Papers: Minimal Complexities for Infinite Words Written with d Letters.- Alternate Base Numeration Systems.- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words.- Longest common subsequence with gap constraints.- On Substitutions Preserving their Return Sets.- Recurrence and frequencies.- Sturmian and infinitely desubstitutable words accepted by an ?-automaton.- String attractors for factors of the Thue-Morse word.- Critical exponent of Arnoux-Rauzy sequences.- On a class of 2-balanced sequences.- Order conditions for languages.- On Sensitivity of Compact Directed Acyclic Word Graphs.- Smallest and Largest Block Palindrome Factorizations.- String attractors of fixed points of k-bonacci-like morphisms.- Magic Numbers in Periodic Sequences.- Dyck Words, Pattern Avoidance,and Automatic Sequences.- Rudin-Shapiro Sums Via Automata Theory and Logic.- Automaticity and Parikh-collinear morphisms.- On the solution sets of entire systems of word equations.- On arch factorization and subword universality for words and compressed words.- Characteristic sequences of the sets of sums of squares as columns of cellular automata.