Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / edited by Anna Frid, Robert Mercaş.

Format:

Book

Author/Creator:

Frid, Anna.

Contributor:

Mercaş, Robert.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 13899

Language:

English

Subjects (All):

Machine theory.

Computer networks.

Algorithms.

Natural language processing (Computer science).

Computer science--Mathematics.

Computer science.

Discrete mathematics.

Formal Languages and Automata Theory.

Computer Communication Networks.

Natural Language Processing (NLP).

Discrete Mathematics in Computer Science.

Local Subjects:

Formal Languages and Automata Theory.

Computer Communication Networks.

Algorithms.

Natural Language Processing (NLP).

Discrete Mathematics in Computer Science.

Physical Description:

1 online resource (310 pages)

Edition:

1st ed. 2023.

Place of Publication:

Cham : Springer Nature Switzerland : Imprint: Springer, 2023.

Summary:

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.

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.

Notes:

Description based on publisher supplied metadata and other sources.

Other Format:

Print version: Frid, Anna Combinatorics on Words

ISBN:

9783031331800

303133180X

OCLC:

1381093925