Combinatorics on Words 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings /

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

Description complète

Enregistré dans:
Détails bibliographiques
Collectivité auteur: SpringerLink (Online service)
Autres auteurs: Frid, Anna (Éditeur intellectuel), Mercaş, Robert (Éditeur intellectuel)
Format: Électronique eBook
Langue:anglais
Publié: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Édition:1st ed. 2023.
Collection:Lecture Notes in Computer Science, 13899
Sujets:
Accès en ligne:https://doi.org/10.1007/978-3-031-33180-0
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-33180-0
003 DE-He213
005 20260810165515.0
007 cr nn 008mamaa
008 230511s2023 sz | o |||| 0|eng d
020 |a 9783031331800  |9 978-3-031-33180-0 
024 7 |a 10.1007/978-3-031-33180-0  |2 doi 
050 4 |a QA267-268.5 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 005.131  |2 23 
245 1 0 |a Combinatorics on Words  |h [electronic resource] :  |b 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings /  |c edited by Anna Frid, Robert Mercaş. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (X, 301 p. 32 illus.).  |b 7 illus. in color. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13899 
505 0 |a 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. 
520 |a 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. 
588 |a Print version record. 
650 0 |a Machine theory. 
650 0 |a Computer networks . 
650 0 |a Algorithms. 
650 0 |a Natural language processing (Computer science). 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Discrete mathematics. 
650 1 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithms. 
650 2 4 |a Natural Language Processing (NLP). 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Frid, Anna.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Mercaş, Robert.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031331794 
776 0 8 |i Printed edition:  |z 9783031331817 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13899 
856 4 0 |u https://doi.org/10.1007/978-3-031-33180-0 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)