001439521 000__ 04106cam\a2200649\i\4500
001439521 001__ 1439521
001439521 003__ OCoLC
001439521 005__ 20230309004432.0
001439521 006__ m\\\\\o\\d\\\\\\\\
001439521 007__ cr\un\nnnunnun
001439521 008__ 210908s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001439521 019__ $$a1267764777
001439521 020__ $$a9783030850883$$q(electronic bk.)
001439521 020__ $$a3030850889$$q(electronic bk.)
001439521 020__ $$z9783030850876
001439521 020__ $$z3030850870
001439521 0247_ $$a10.1007/978-3-030-85088-3$$2doi
001439521 035__ $$aSP(OCoLC)1267457663
001439521 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCO$$dOCLCF$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCQ
001439521 049__ $$aISEA
001439521 050_4 $$aQA164$$b.W67 2021
001439521 08204 $$a511/.6$$223
001439521 1112_ $$aWORDS (Conference)$$n(13th :$$d2021 :$$cOnline)
001439521 24510 $$aCombinatorics on words :$$b13th international conference, WORDS 2021, Rouen, France, September 13-17, 2021 : proceedings /$$cThierry Lecroq, Svetlana Puzynina (eds.).
001439521 24630 $$aWORDS 2021
001439521 264_1 $$aCham :$$bSpringer,$$c[2021]
001439521 264_4 $$c©2021
001439521 300__ $$a1 online resource :$$billustrations
001439521 336__ $$atext$$btxt$$2rdacontent
001439521 337__ $$acomputer$$bc$$2rdamedia
001439521 338__ $$aonline resource$$bcr$$2rdacarrier
001439521 4901_ $$aLecture notes in computer science ;$$v12847
001439521 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
001439521 500__ $$aInternational conference proceedings.
001439521 500__ $$aIncludes author index.
001439521 5050_ $$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.
001439521 506__ $$aAccess limited to authorized users.
001439521 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.
001439521 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 13, 2021).
001439521 650_0 $$aCombinatorial analysis$$vCongresses.
001439521 650_0 $$aWord problems (Mathematics)$$vCongresses.
001439521 650_6 $$aAnalyse combinatoire$$vCongrès.
001439521 650_6 $$aProblèmes des mots (Mathématiques)$$vCongrès.
001439521 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001439521 655_7 $$aConference papers and proceedings.$$2lcgft
001439521 655_7 $$aActes de congrès.$$2rvmgf
001439521 655_0 $$aElectronic books.
001439521 7001_ $$aLecroq, Thierry,$$eeditor.
001439521 7001_ $$aPuzynina, Svetlana,$$eeditor.
001439521 830_0 $$aLecture notes in computer science ;$$v12847.
001439521 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001439521 852__ $$bebk
001439521 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-85088-3$$zOnline Access$$91397441.1
001439521 909CO $$ooai:library.usi.edu:1439521$$pGLOBAL_SET
001439521 980__ $$aBIB
001439521 980__ $$aEBOOK
001439521 982__ $$aEbook
001439521 983__ $$aOnline
001439521 994__ $$a92$$bISE