Overview

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

Full Product Details

Author:   Anna Frid ,  Robert Mercaş
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2023
Volume:   13899
Weight:   0.480kg
ISBN:  

9783031331794

ISBN 10:   3031331796
Pages:   301
Publication Date:   12 May 2023
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

​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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions