Combinatorics on Words 13th International Conference, WORDS 2021, Rouen, France, September 13–17, 2021, Proceedings

This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS...

Full description

Bibliographic Details
Other Authors: Lecroq, Thierry (Editor), Puzynina, Svetlana (Editor)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2021, 2021
Edition:1st ed. 2021
Series:Theoretical Computer Science and General Issues
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03045nmm a2200385 u 4500
001 EB002002494
003 EBX01000000000000001165395
005 00000000000000.0
007 cr|||||||||||||||||||||
008 211011 ||| eng
020 |a 9783030850883 
100 1 |a Lecroq, Thierry  |e [editor] 
245 0 0 |a Combinatorics on Words  |h Elektronische Ressource  |b 13th International Conference, WORDS 2021, Rouen, France, September 13–17, 2021, Proceedings  |c edited by Thierry Lecroq, Svetlana Puzynina 
250 |a 1st ed. 2021 
260 |a Cham  |b Springer International Publishing  |c 2021, 2021 
300 |a XII, 199 p. 22 illus  |b online resource 
505 0 |a Synchronized Sequences -- Continuants with equal values, a combinatorial approach -- Quaternary n-cubes and Isometric Words -- Strings from linear recurrences: a Gray code -- String Theories involving Regular Membership Predicates: From Practice to Theory and Back -- Binary cyclotomic polynomials: representation via words and algorithms -- Computation of critical exponent in balanced sequences -- The Range Automaton: An Efficient Approach to Text-Searching -- A numeration system for Fibonacci-like Wang shifts -- Perfectly clustering words are primitive positive elements of the free group -- On Billaud Words and Their Companions -- Counting ternary square-free words quickly -- Doubled patterns with reversal are 3-avoidable -- A characterization of binary morphisms generating Lyndon in finite words -- Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order -- Equations over the k-binomial monoids 
653 |a Computer Communication Networks 
653 |a Computer science / Mathematics 
653 |a Discrete Mathematics in Computer Science 
653 |a Algorithms 
653 |a Formal Languages and Automata Theory 
653 |a Computer networks  
653 |a Machine theory 
653 |a Natural Language Processing (NLP) 
653 |a Discrete mathematics 
653 |a Natural language processing (Computer science) 
700 1 |a Puzynina, Svetlana  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-030-85088-3 
856 4 0 |u https://doi.org/10.1007/978-3-030-85088-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 5,131 
520 |a This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc