LEADER 04019nam  22007215  450 
001 9910502647703321
005 20251225174938.0
010   $a3-030-85088-9
024 7 $a10.1007/978-3-030-85088-3
035   $a(CKB)4100000012024126
035   $a(MiAaPQ)EBC6720688
035   $a(Au-PeEL)EBL6720688
035   $a(OCoLC)1267457663
035   $a(DE-He213)978-3-030-85088-3
035   $a(PPN)258051116
035   $a(EXLCZ)994100000012024126
100   $a20210812d2021      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aCombinatorics on Words $e13th International Conference, WORDS 2021, Rouen, France, September 13?17, 2021, Proceedings /$fedited by Thierry Lecroq, Svetlana Puzynina
205   $a1st ed. 2021.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021.
215   $a1 online resource (210 pages)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12847
311 08$a3-030-85087-0 
327   $aSynchronized 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12847
606   $aMachine theory
606   $aComputer networks
606   $aAlgorithms
606   $aNatural language processing (Computer science)
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aFormal Languages and Automata Theory
606   $aComputer Communication Networks
606   $aAlgorithms
606   $aNatural Language Processing (NLP)
606   $aDiscrete Mathematics in Computer Science
615  0$aMachine theory.
615  0$aComputer networks.
615  0$aAlgorithms.
615  0$aNatural language processing (Computer science).
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615 14$aFormal Languages and Automata Theory.
615 24$aComputer Communication Networks.
615 24$aAlgorithms.
615 24$aNatural Language Processing (NLP).
615 24$aDiscrete Mathematics in Computer Science.
676   $a511.6
702   $aPuzynina$b Svetlana
702   $aLecroq$b Thierry
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910502647703321
996   $aCombinatorics on words$9343975
997   $aUNINA