LEADER 04516nam 22006975 450 001 996466441503316 005 20230222000017.0 010 $a3-030-28796-3 024 7 $a10.1007/978-3-030-28796-2 035 $a(CKB)4100000009160277 035 $a(DE-He213)978-3-030-28796-2 035 $a(MiAaPQ)EBC5926348 035 $a(PPN)242823750 035 $a(EXLCZ)994100000009160277 100 $a20190808d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorics on Words$b[electronic resource] $e12th International Conference, WORDS 2019, Loughborough, UK, September 9?13, 2019, Proceedings /$fedited by Robert Merca?, Daniel Reidenbach 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XIV, 327 p. 300 illus., 6 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11682 311 $a3-030-28795-5 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11682 606 $aMachine theory 606 $aLogic programming 606 $aComputer science?Mathematics 606 $aImage processing?Digital techniques 606 $aComputer vision 606 $aArtificial intelligence?Data processing 606 $aFormal Languages and Automata Theory 606 $aLogic in AI 606 $aMathematics of Computing 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Science 615 0$aMachine theory. 615 0$aLogic programming. 615 0$aComputer science?Mathematics. 615 0$aImage processing?Digital techniques. 615 0$aComputer vision. 615 0$aArtificial intelligence?Data processing. 615 14$aFormal Languages and Automata Theory. 615 24$aLogic in AI. 615 24$aMathematics of Computing. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Science. 676 $a511.6 702 $aMerca?$b Robert$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReidenbach$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466441503316 996 $aCombinatorics on words$9343975 997 $aUNISA