000 04438nam a22006135i 4500
001 978-3-030-28796-2
003 DE-He213
005 20240730170121.0
007 cr nn 008mamaa
008 190808s2019 sz | s |||| 0|eng d
020 _a9783030287962
_9978-3-030-28796-2
024 7 _a10.1007/978-3-030-28796-2
_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] :
_b12th International Conference, WORDS 2019, Loughborough, UK, September 9-13, 2019, Proceedings /
_cedited by Robert Mercaş, Daniel Reidenbach.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXIV, 327 p. 300 illus., 6 illus. in color.
_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 ;
_v11682
505 0 _aMatching patterns with variables -- Abelian properties of words -- On sets of words of rank two -- On families of limit S-adic words -- Independent systems of word equations: from Ehrenfeucht to eighteen -- Parikh determinants -- Critical exponent of infinite balanced words via the Pell number system -- Repetitions in infinite palindrome-rich words -- Generalized Lyndon factorizations of infinite words -- On the commutative equivalence of bounded semi-linear codes -- Circularly squarefree words and unbordered conjugates: a new approach -- The undirected repetition threshold -- Characteristic parameters and special trapezoidal words -- Return words and bifix codes in eventually dendric sets -- Enumeration and extensions of word-representable graphs -- Localisation-resistant random words with small alphabets -- On codeword lengths guaranteeing synchronization -- Binary intersection revisited -- On substitutions closed under derivation: examples -- Templates for the k-binomial complexity of the Tribonacci word -- Derived sequences of Arnoux-Rauzy sequences -- New results on pseudosquare avoidance -- Every nonnegative real number is a critical abelian exponent -- Rich words containing two given factors -- Mortality and synchronization of unambiguous finite automata -- On discrete idempotent paths.
520 _aThis book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019. The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 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.
_992134
650 0 _aLogic programming.
_92730
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aImage processing
_xDigital techniques.
_94145
650 0 _aComputer vision.
_992135
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aFormal Languages and Automata Theory.
_992136
650 2 4 _aLogic in AI.
_933012
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
_931569
650 2 4 _aData Science.
_934092
700 1 _aMercaş, Robert.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992137
700 1 _aReidenbach, Daniel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992138
710 2 _aSpringerLink (Online service)
_992139
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030287955
776 0 8 _iPrinted edition:
_z9783030287979
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11682
_992140
856 4 0 _uhttps://doi.org/10.1007/978-3-030-28796-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86748
_d86748