000 04024nam a22006135i 4500
001 978-3-030-85088-3
003 DE-He213
005 20240730171915.0
007 cr nn 008mamaa
008 210812s2021 sz | s |||| 0|eng d
020 _a9783030850883
_9978-3-030-85088-3
024 7 _a10.1007/978-3-030-85088-3
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aCombinatorics on Words
_h[electronic resource] :
_b13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021, Proceedings /
_cedited by Thierry Lecroq, Svetlana Puzynina.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXII, 199 p. 22 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12847
505 0 _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.
520 _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.
650 0 _aMachine theory.
_9100829
650 0 _aComputer networks .
_931572
650 0 _aAlgorithms.
_93390
650 0 _aNatural language processing (Computer science).
_94741
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aFormal Languages and Automata Theory.
_9100831
650 2 4 _aComputer Communication Networks.
_9100833
650 2 4 _aAlgorithms.
_93390
650 2 4 _aNatural Language Processing (NLP).
_931587
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aLecroq, Thierry.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100836
700 1 _aPuzynina, Svetlana.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100837
710 2 _aSpringerLink (Online service)
_9100839
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030850876
776 0 8 _iPrinted edition:
_z9783030850890
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12847
_9100840
856 4 0 _uhttps://doi.org/10.1007/978-3-030-85088-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87877
_d87877